{"id":23537,"date":"2020-07-16T17:13:19","date_gmt":"2020-07-16T17:13:19","guid":{"rendered":"https:\/\/www.inspirenignite.com\/jntuh\/cs501pc-formal-languages-and-automata-theory-it-syllabus-for-btech-3rd-year-1st-sem-r18-regulation-jntuh\/"},"modified":"2020-07-16T17:13:19","modified_gmt":"2020-07-16T17:13:19","slug":"cs501pc-formal-languages-and-automata-theory-it-syllabus-for-btech-3rd-year-1st-sem-r18-regulation-jntuh","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/jntuh\/cs501pc-formal-languages-and-automata-theory-it-syllabus-for-btech-3rd-year-1st-sem-r18-regulation-jntuh\/","title":{"rendered":"CS501PC: Formal Languages and Automata Theory IT Syllabus for B.Tech 3rd Year 1st Sem R18 Regulation JNTUH"},"content":{"rendered":"

Formal Languages and Automata Theory detailed Syllabus for Information Technology (IT), R18 regulation has been taken from the JNTUH<\/a> official website and presented for the students affiliated to JNTUH course structure. For Course Code, Subject Names, Theory Lectures, Tutorial, Practical\/Drawing, Credits, and other information do visit full semester subjects post given below. The Syllabus PDF files can also be downloaded from the universities official website.<\/p>\n

For all other IT 3rd Year 1st Sem Syllabus for B.Tech R18 Regulation JNTUH, do visit IT 3rd Year 1st Sem Syllabus for B.Tech R18 Regulation JNTUH <\/a>Subjects. The detailed Syllabus for formal languages and automata theory is as follows. <\/p>\n

Pre-requisite:<\/h4>\n

For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App<\/a>
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.<\/b>
\"Get<\/a>.<\/p>\n

Course Objectives:<\/h4>\n

\n

    \n
  1. To provide introduction to some of the central ideas of theoretical computer science from the perspective of formal languages.<\/li>\n
  2. To introduce the fundamental concepts of formal languages, grammars and automata theory.<\/li>\n
  3. Classify machines by their power to recognize languages.<\/li>\n
  4. Employ finite state machines to solve problems in computing.<\/li>\n
  5. To understand deterministic and non-deterministic machines.<\/li>\n
  6. To understand the differences between decidability and undecidability.<\/li>\n<\/ol>\n

    Course Outcomes:<\/h4>\n

    \n

      \n
    1. Able to understand the concept of abstract machines and their power to recognize the languages.<\/li>\n
    2. Able to employ finite state machines for modeling and solving computing problems.<\/li>\n
    3. Able to design context free grammars for formal languages.<\/li>\n
    4. Able to distinguish between decidability and undecidability.<\/li>\n
    5. Able to gain proficiency with mathematical tools and formal methods.<\/li>\n<\/ol>\n

      Unit I<\/h4>\n

      For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App<\/a>
      It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.<\/b>
      \"Get<\/a>. <\/p>\n

      Unit II<\/h4>\n

      \nRegular Expressions: Finite Automata and Regular Expressions, Applications of Regular Expressions, Algebraic Laws for Regular Expressions, Conversion of Finite Automata to Regular Expressions.<\/p>\n

      Pumping Lemma for Regular Languages, Statement of the pumping lemma, Applications of the Pumping Lemma.<\/p>\n

      Closure Properties of Regular Languages: Closure properties of Regular languages, Decision Properties of Regular Languages, Equivalence and Minimization of Automata.<\/p>\n

      Unit III<\/h4>\n

      \nContext-Free Grammars: Definition of Context-Free Grammars, Derivations Using a Grammar, Leftmost and Rightmost Derivations, the Language of a Grammar, Sentential Forms, Parse Tress, Applications of Context-Free Grammars, Ambiguity in Grammars and Languages.<\/p>\n

      Push Down Automata: Definition of the Pushdown Automaton, the Languages of a PDA, Equivalence of PDA’s and CFG’s, Acceptance by final state, Acceptance by empty stack, Deterministic Pushdown Automata. From CFG to PDA, From PDA to CFG.<\/p>\n

      Unit IV<\/h4>\n

      For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App<\/a>
      It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.<\/b>
      \"Get<\/a>. <\/p>\n

      Unit V<\/h4>\n

      \nTypes of Turing machine: Turing machines and halting<\/p>\n

      Undecidability: Undecidability, A Language that is Not Recursively Enumerable, An Undecidable Problem That is RE, Undecidable Problems about Turing Machines, Recursive languages, Properties of recursive languages, Post’s Correspondence Problem, Modified Post Correspondence problem, Other Undecidable Problems, Counter machines.<\/p>\n

      Text Books:<\/h4>\n

      \n

        \n
      1. Introduction to Automata Theory, Languages, and Computation, 3nd Edition, John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Pearson Education.<\/li>\n
      2. Theory of Computer Science – Automata languages and computation, Mishra and Chandrashekaran, 2nd edition, PHI.<\/li>\n<\/ol>\n

        Reference Book:<\/h4>\n

        For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App<\/a>
        It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.<\/b>
        \"Get<\/a>.<\/p>\n

        For detail Syllabus of all other subjects of B.Tech 3rd Year Information Technology, visit IT 3rd Year Syllabus<\/a> Subjects.<\/p>\n

        For all B.Tech results, visit JNTUH B.Tech all years, and semester results <\/a>from direct links.<\/p>\n","protected":false},"excerpt":{"rendered":"

        Formal Languages and Automata Theory detailed Syllabus for Information Technology (IT), R18 regulation has been taken from the JNTUH official website and presented for the students affiliated to JNTUH course […]<\/p>\n","protected":false},"author":2344,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0,"footnotes":""},"categories":[122,114],"tags":[],"class_list":["post-23537","post","type-post","status-publish","format-standard","hentry","category-3rd-year","category-it"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/23537","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/users\/2344"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/comments?post=23537"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/23537\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/media?parent=23537"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/categories?post=23537"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/tags?post=23537"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}