{"id":477,"date":"2016-07-23T07:49:28","date_gmt":"2016-07-23T07:49:28","guid":{"rendered":"http:\/\/www.inspirenignite.com\/jntuk\/?p=477"},"modified":"2016-08-07T12:25:48","modified_gmt":"2016-08-07T12:25:48","slug":"jntuk-b-tech-formal-languages-automata-theory-for-r13-batch","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/jntuk\/jntuk-b-tech-formal-languages-automata-theory-for-r13-batch\/","title":{"rendered":"JNTUK B.Tech Formal Languages &amp; Automata Theory for R13 Batch."},"content":{"rendered":"<p>JNTUK B.Tech Formal Languages &amp; Automata Theory gives you detail information of Formal Languages &amp; Automata R13 syllabus It will be help full to understand you complete curriculum of the year.<\/p><div class=\"a9916ad81d5189659b0bfae0b37c143c\" data-index=\"1\" style=\"float: none; margin:10px 0 10px 0; text-align:center;\">\n<ins class=\"adsbygoogle\"\r\n     style=\"display:block; text-align:center;\"\r\n     data-ad-layout=\"in-article\"\r\n     data-ad-format=\"fluid\"\r\n     data-ad-client=\"ca-pub-1181153414625576\"\r\n     data-ad-slot=\"9648548092\"><\/ins>\r\n<script>\r\n     (adsbygoogle = window.adsbygoogle || []).push({});\r\n<\/script>\n<\/div>\n\n<p><strong>Objectives<\/strong>: Understanding of programming language construct, how input is converted into output\u00a0from the machine hardware level<\/p>\n<p><strong>UNIT I<\/strong><\/p>\n<ul>\n<li><strong>Objectives:<\/strong> Analysis of Finite state machine, its representation and automata<\/li>\n<li><strong>Fundamentals of Automata<\/strong>&#8211; Computation, Finite State Machine, Components of Finite State Automata, Elements of Finite State System ,Mathematical representation of Finite State Machine, Automata Classification, Automata in Real World<\/li>\n<\/ul>\n<p><strong>UNIT II<\/strong><\/p>\n<ul>\n<li><strong>Objectives<\/strong>: Delineation of various components of formal languages and grammars.<\/li>\n<li><strong>Formal Language Theory<\/strong>&#8211; Symbols, Alphabets and Strings, Operations on Strings, Formal Languages, Operations on Languages,\u00a0Formal Languages\/ Grammar Hierarchy: Formal Languages, Regular Language, Context-Free Language, Context-Sensitive Language, Recursive Language, Recursively Enumerable Language, Other Forms of Formal Languages, Relationship between Grammars and Languages<\/li>\n<\/ul>\n<p><strong>UNIT III<\/strong><\/p>\n<ul>\n<li><strong>Objectives:<\/strong> Description of finite automata, variants in it and their equivalence<\/li>\n<li><strong>Finite Automata<\/strong>: Introduction, Deterministic Finite Automata(DFA), Design of DFAs, Non Deterministic Finite Automata(NFA), Non-Deterministic Automata with \u0404-moves , Design of NFA- \u0404 s, Advantages of Non-Deterministic Finite Automata, NFA Versus DFA<\/li>\n<li><strong>Equivalent Automata:<\/strong> Equivalent Finite-State Automata, Equivalence of NFA\/NFA- \u025b and DFA, Equivalence of NFA, with \u0404 moves to NFA, without \u0404 &#8211; moves.<\/li>\n<\/ul>\n<p><strong>UNIT IV<\/strong><\/p>\n<ul>\n<li><strong>Objectives:<\/strong> Minimization, optimization of finite automata, regular expressions and equivalence of finite automata and regular expressions.<\/li>\n<li><strong>Minimization\/ Optimization of DFA:<\/strong> Optimum DFA, Minimal DFA, Two way DFA, DFA Vs 2DFA Regular Expressions and Languages:Regular languages, Regular expressions, Components of Regular Expression, Properties of Regular Expressions, Uses of Regular Expressions. Finite Automata and Regular Expressions:Properties of Regular Sets and Regular Languages, Arden\u2019s<br \/>\nTheorem, Equivalence of Finite Automata and Regular Expressions, Equivalence of DFA and Regular Expression, Equivalence of NFA and Regular Expression<\/li>\n<\/ul>\n<p><strong>UNIT V<\/strong><\/p>\n<ul>\n<li><strong>Objectives<\/strong>: Illustration about grammars, classification and simplification of grammaers<\/li>\n<li><strong>Transducers:<\/strong> Moore Machine, Mealy Machine, Difference between Moore and Mealy Machines, Properties \/ Equivalence of Moore and Mealy Machines. Context-Free Grammars and Context-Free Languages: Types of Grammar, Ambiguous and Unambiguous Grammars, Noam Chomsky\u2019s Classification of Grammar and Finite Automata, Relation between Regular Grammar and Finite Automata. Simplification of Context \u2013 Free Grammar: Simplification of Context-Free Grammars, Elimination of \u0404 &#8211; Productions, Elimination of Unit Productions, Normal Forms for Context Free Grammars, Chomsky Normal Form, Greibach Normal Form, Chomsky Vs. Greibach Normal Form, Application of Context- Free Grammars<\/li>\n<\/ul>\n<p><strong>UNIT VI<\/strong><\/p>\n<ul>\n<li><strong>Objectives:<\/strong> Delineation of turing machines<\/li>\n<li><strong>Turing Machine:<\/strong> Introduction, Components of Turing Machine, Description of Turing Machine, Elements of TM, Moves of a TM, Language accepted by a TM, Role of TM\u2019s , Design of TM\u2019s TM Extensions and Languages: TM Languages, Undecidable Problem, P and NP Classes of Languages.<\/li>\n<\/ul>\n<p><strong>Text Books<\/strong><\/p>\n<ul>\n<li>A Text Book on Automata Theory, Nasir S.F.B, P.K. Srimani, Cambridge university Press<\/li>\n<li>Introduction to Automata Theory, Formal languages and computation, Shamalendu kandar, Pearson<\/li>\n<li>Elements of Theory of Compuation, Harry R Lewis, Papdimitriou, PHI<\/li>\n<li>Introduction to theory of computation, 2nd ed, Michel sipser, CENGAGE<\/li>\n<\/ul>\n<p><strong>Reference Books<\/strong><\/p>\n<ul>\n<li>Formal Languages and automata theory, C.K. Nagpal, OXFORD<\/li>\n<li>Theory of Computation , aproblem solving approach, kavi Mahesh, Wiley<\/li>\n<li>Automata, computability and complexity, Theory and applications, Elaine rich, PEARSON<\/li>\n<li>Theory of Computation, Vivek kulkarni, OXFORD<\/li>\n<\/ul>\n<p>For more information about all JNTU updates please stay connected to us on FB and don\u2019t hesitate to ask any questions in the comment.<\/p>\n<div class=\"a9916ad81d5189659b0bfae0b37c143c\" data-index=\"2\" style=\"float: none; margin:10px 0 10px 0; text-align:center;\">\n<ins class=\"adsbygoogle\"\r\n     style=\"display:block; text-align:center;\"\r\n     data-ad-layout=\"in-article\"\r\n     data-ad-format=\"fluid\"\r\n     data-ad-client=\"ca-pub-1181153414625576\"\r\n     data-ad-slot=\"8060844699\"><\/ins>\r\n<script>\r\n     (adsbygoogle = window.adsbygoogle || []).push({});\r\n<\/script>\n<\/div>\n\n<div style=\"font-size: 0px; height: 0px; line-height: 0px; margin: 0; padding: 0; clear: both;\"><\/div>","protected":false},"excerpt":{"rendered":"<p>JNTUK B.Tech Formal Languages &amp; Automata Theory gives you detail information of Formal Languages &amp; Automata R13 syllabus It will be help full to understand you complete curriculum of the [&hellip;]<\/p>\n","protected":false},"author":2259,"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":[2],"tags":[],"class_list":["post-477","post","type-post","status-publish","format-standard","hentry","category-syllabus"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/posts\/477","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/users\/2259"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/comments?post=477"}],"version-history":[{"count":1,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/posts\/477\/revisions"}],"predecessor-version":[{"id":478,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/posts\/477\/revisions\/478"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/media?parent=477"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/categories?post=477"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/tags?post=477"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}