{"id":7047,"date":"2019-12-14T16:50:11","date_gmt":"2019-12-14T16:50:11","guid":{"rendered":"https:\/\/www.inspirenignite.com\/vtu\/automata-theory-and-computability-is-5th-sem-syllabus-for-vtu-be-2017-scheme\/"},"modified":"2019-12-14T16:50:11","modified_gmt":"2019-12-14T16:50:11","slug":"automata-theory-and-computability-is-5th-sem-syllabus-for-vtu-be-2017-scheme","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/vtu\/automata-theory-and-computability-is-5th-sem-syllabus-for-vtu-be-2017-scheme\/","title":{"rendered":"Automata Theory and Computability IS 5th Sem Syllabus for VTU BE 2017 Scheme"},"content":{"rendered":"

Automata Theory and Computability detail syllabus for Information Science Engineering (Is), 2017 scheme is taken from VTU<\/a> official website and presented for VTU students. The course code (17CS54), and for exam duration, Teaching Hr\/week, Practical Hr\/week, Total Marks, internal marks, theory marks, duration and credits do visit complete sem subjects post given below.<\/p>\n

For all other is 5th sem syllabus for be 2017 scheme vtu you can visit IS 5th Sem syllabus for BE 2017 Scheme VTU Subjects<\/a>. The detail syllabus for automata theory and computability is as follows.<\/p>\n

Module 1\t\t\t\t<\/h4>\n

Why study the Theory of Computation, Languages and Strings: Strings, Languages. A Language Hierarchy, Computation, Finite State Machines (FSM): Deterministic FSM, Regular languages, Designing FSM, Nondeterministic FSMs, From FSMs to Operational Systems, Simulators for FSMs, Minimizing FSMs, Canonical form of Regular languages, Finite State Transducers, Bidirectional Transducers. Textbook 1: Ch 1,2, 3,4, 5.1 to 5.10\n<\/p>\n

Module 2
\nFor complete syllabus and results, class timetable and more pls download iStudy<\/a>. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.<\/p>\n

Module 3
\n<\/h4>\n

Context-Free Grammars(CFG): Introduction to Rewrite Systems and Grammars, CFGs and languages, designing CFGs, simplifying CFGs, proving that a Grammar is correct, Derivation and Parse trees, Ambiguity, Normal Forms. Pushdown Automata (PDA): Definition of non-deterministic PDA, Deterministic and Non-deterministic PDAs, Non-determinism and Halting, alternative equivalent definitions of a PDA, alternatives that are not equivalent to PDA. Textbook 1: Ch 11, 12: 11.1 to 11.8, 12.1, 12.2, 12,4, 12.5, 12.6\n<\/p>\n

Module 4
\n<\/h4>\n

Context-Free and Non-Context-Free Languages: Where do the Context-Free Languages(CFL) fit, Showing a language is context-free, Pumping theorem for CFL, Important closure properties of CFLs, Deterministic CFLs. Algorithms and Decision Procedures for CFLs: Decidable questions, Un-decidable questions. Turing Machine: Turing machine model, Representation, Language acceptability by TM, design of TM, Techniques for TM construction. Textbook 1: Ch 13: 13.1 to 13.5, Ch 14: 14.1, 14.2, Textbook 2: Ch 9.1 to 9.6\n<\/p>\n

Module 5
\nFor complete syllabus and results, class timetable and more pls download iStudy<\/a>. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.<\/p>\n

Course Outcomes:<\/h4>\n

The students should be able to:\t\t\t\t<\/p>\n