Scribd
Upload
2K views1 page

Automata Theory & Formal Languages

This document outlines the units of study for a course on Automata Theory and Formal Languages. The 5 units cover: 1) finite automata and regular expressions; 2) properties of regular sets; 3) context-free grammars; 4) pushdown automata and properties of context-free languages; and 5) Turing machines and the Chomsky hierarchy. The recommended textbook is Introduction to Automata Theory & Languages and Computation by Hopcroft and Ullman.

Uploaded by

mnsailesh
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2K views1 page

Automata Theory & Formal Languages

This document outlines the units of study for a course on Automata Theory and Formal Languages. The 5 units cover: 1) finite automata and regular expressions; 2) properties of regular sets; 3) context-free grammars; 4) pushdown automata and properties of context-free languages; and 5) Turing machines and the Chomsky hierarchy. The recommended textbook is Introduction to Automata Theory & Languages and Computation by Hopcroft and Ullman.

Uploaded by

mnsailesh
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

AUTOMATA THEORY & FORMAL LANGUAGES EM324

UNIT I

Finite Automata & Regular Expressions: finite state systems, Non-Deterministic Finite Automata,
Finite Automata with E-Moves, Regular Expressions, Two-way finite automata, Finite Automata with
output (12)

UNIT II

Properties Of Regular Sets: The Pumping Lemma For Regular Sets, Closure Properties of Regular
Sets,Decision Algorithms For Regular Sets, The MYHILL – NERODE Theorem and minimization of
Finite Automata (12)

UNIT III

Context Free Grammars: Context Free Grammars, Derivation Trees; Simplification of context free
grammars. Chomsky Normal Form; Greibach Normal Form; (12)

UNIT IV

Pushdown Automata, Properties of Context Free Languages: The Pumping Lemma For CFL’s,Closure
Properties of CFL’s; Decision Algorithms for CFL’s (12)

UNIT V

Turing Machines: The Turing Machine Model, Computable Languages and functions, Techniques of
Turing Machine Construction, Undecidability: Properties of Recursive and Recursively Enumerable
Languages; Universal Turing Machines (without any reference to undecidable problems),

The Chomsky Hierarchy: Regular grammars, Unrestricted grammars, Context sensitive languages.
(12)

TEXT BOOK

1. John E Hopcroft & Jeffery D Ullman’ ‘Introduction to Automata Theory & Languages and
Computation’, Narosa Publishing House.

REFERENCE BOOKS

1. Cohen, ‘Computer Theory’.

2. KLP Mishra & N.Chandrasekharan, ‘Theory of Computation’, PHI.

You might also like