Download Automata Theory Previous Year Papers in PDF format from the links given below. These papers are for KUK B.Tech 5th Sem students. But if you have a subject called Automata in your syllabus too then you can check out these papers too for finding out the important questions for automata exam. That’s not all, all papers are directly downloadable from Google Drive. So, don’t waste time and head below for Automata Previous Year Question Papers.
Automata Previous Year Question Papers PDF Download KUK B.Tech 5th Sem
Automata Syllabus for KUK B.Tech 5th Sem CSE
Automata Unit 1 Syllabus
Finite Automata and Regular Expression: Finite State System, Basic Definition Non- Deterministic finite Automata (NDFA). Deterministic Finite Automata (DFA), Equivalence of DFA and NDFA, Finite Automata with E-moves. Regular Expression, Equivalence of finite Automata and expression. Regular expression conversion and Vice- Versa.
Automata Unit 2 Syllabus
Introduction to Machines: Concept of basic machines, Properties and limitations of FSM, Moore and Mealy Machines, Equivalence of Moore and Mealy Machines. Conversion of NFA and DFA by Arden’s method.
Automata Unit 3 Syllabus
Grammars: Definitions, Context free and Context sensitive Grammar, Ambiguity, Regular Grammar, Reduced forms, Removal of useless symbols and unit production, Chomsky Normal Form.
Automata Unit 4 Syllabus
Turing Machines, Deterministic and Non-Deterministic Turing Machines, Design of T.M., Halting Problem of T.M. PCP problem.
Chomsky Hierarchy: Chomsky hierarchies of grammars, unrestricted grammar, Context sensitive Language, Relation between Languages of classes.
Computability: Basic Concepts, Primitive Recursive Functions.
Automata Theory Previous Year Papers Download
Find Google Drive Link of Previous Year Automata Papers from below:
Recommended Books for Automata B.Tech CSE 5th Sem:
- R.B. Patel, & Prem Nath, Theory of Automata and Formal Languages, Umesh Publication, New Delhi, Ist Edition 2005, ISBN-81-88114-53-7, pp. 1-496.
- John C. Martin: Introduction to Language and the Theory of Computation, MGH.