Scribd
Upload
68 views1 page

AutomataTheory syllabusUG

The document outlines four modules covering key concepts in automata theory and formal languages, including regular languages, context-free grammars, Turing machines, and undecidability. It discusses various types of automata, their properties, and the relationships between different language classes. Additionally, it provides main and supplementary reading materials for further study in the field.

Uploaded by

gopogo56
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
68 views1 page

AutomataTheory syllabusUG

The document outlines four modules covering key concepts in automata theory and formal languages, including regular languages, context-free grammars, Turing machines, and undecidability. It discusses various types of automata, their properties, and the relationships between different language classes. Additionally, it provides main and supplementary reading materials for further study in the field.

Uploaded by

gopogo56
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Module-1: Regular Languages and Finite Automata

Introduction, Alphabet, Language, and Grammar. Regular Expressions and Languages,


Deterministic Finite Automata (DFA) and Equivalence with Regular Expressions,
Nondeterministic Finite Automata (NFA) and Equivalence with DFA, Regular Grammars
and Equivalence with Finite Automata, Properties of Regular Languages, Pumping Lemma
For Regular Languages, Minimization of Finite Automata.

Module-2: Context-Free Grammar/Languages


Context-Free Grammars (CFG) and Context-Free Languages (CFL), Production, Parse Tree, and
Derivation; Chomsky and Greibach Normal Forms, Non-deterministic Pushdown Automata (PDA) and
Equivalence with CFG, Parse Trees, Ambiguity in CFG, Pumping Lemma for Context-Free Languages,
Deterministic Pushdown Automata, Closure Properties of CFLs. Chomsky Hierarchy of Languages.
Context-Sensitive Grammars: Context-Sensitive Grammars (CSG) and Context sensitive Languages (CSL),
Linear Bounded Automata (LBA) and its Equivalence with CSG.
Module-3: Turing Machines
The Basic Model of Turing Machines (TM), Turing-Recognizable (Recursively Enumerable) and Turing-
Decidable (Recursive) Languages and Their Closure Properties, Variants of Turing Machines, Non-
deterministic TMs and its Equivalence with Deterministic TMs, Unrestricted Grammars and Equivalence
with Turing Machines, TMs as Enumerators.
Module-4: Undecidability
Church-Turing Thesis, Universal Turing Machine, The Universal and Diagonalization
Languages, Reduction between Languages and Rice’s Theorem, Undecidable Problems
about Languages.

Main Reading
1. John E. Hopcroft, Jeffery D. Ullman, Introduction to Automata Theory, Language, and Computation,
Pearson, 3rd Edition, 2007.
2. Michael Sipser, Introduction to the Theory of Computation. Cengage Learning, 2nd Edition, 2006.

Supplementary Reading
1. K.L.P. Mishra and N. Chandrasekharan. Theory of Computer Science, PHI, 3rd Edition, 2008.
2. Harry R. Lewis and Christos H. Papadimitriou. Elements of the Theory of Computation., Prentice Hall,
2nd Edition, 1998.

You might also like