Scribd
Upload
15 views2 pages

TOC Syllabus

Uploaded by

shashankshekharjnv
Copyright
© © All Rights Reserved
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
15 views2 pages

TOC Syllabus

Uploaded by

shashankshekharjnv
Copyright
© © All Rights Reserved
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/ 2

Title of the course : Automata Theory and Formal Languages

Subject Code : PCCS-622


Weekly load : 3 Hrs LTP 2-1-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand basic properties of deterministic and nondeterministic finite automata
CO2 Understand the relation between types of languages and types of finite automata
CO3 Design grammars and recognizers for different formal languages
CO4 Prove or disprove theorems in automata theory using its properties
CO5 Determine the decidability and intractability of computational problems

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):


Programme Outcomes (POs)
Cos PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3 3 2 1 2 0 0 2 2 2 2 2 2
CO2 2 3 3 2 1 2 0 0 2 2 2 3 3 2
CO3 2 3 3 2 2 3 0 0 3 2 2 3 3 2
CO4 2 3 3 3 3 2 0 0 2 2 2 3 3 3
CO5 2 3 3 3 3 3 0 0 2 2 2 3 2 3
Theory

Unit Main Topics Course outlines Lecture(s)


Unit-1 1. Finite Finite state systems, Deterministic, non deterministic finite 08
Automata automata, equivalence of deterministic and non-deterministic
finite automata, Finite automates with & without Ɛ-moves, 2
way finite automata with output, equivalence of Mealy and
Moore machines.
2. Regular Identification of Regular expressions, Finite Automata and 04
Languages Regular expression

3. Properties of The pumping lemma for regular sets, closure properties of 05


Regular Sets: regular sets, decision algorithms of regular sets, The Myhill-
Nerode Theorem & minimization of finite Automata.
4. Context free Introduction to context free grammars, derivation trees, top- 05
grammars down & bottom up parsing methods, ambiguous context free
grammars, Chomsky and Greibach normal forms.

Unit-2 5. Pushdown Deterministic and Non-deterministic pushdown automata, 04


Automata: Equivalence of context free languages and sets accepted by
pushdown automata, Deterministic context free languages.

93
6. Properties of The pumping Lemma for context free languages, closure 06
Context free properties of context free languages, decision algorithms for
Languages context free languages, Coke-Kasmi-Young algorithm.

7. Turning Introduction to Turing Machines, Deterministic, non- 08


Machines: deterministic, two way infinite tape, multi tape,
Constructions of Turing Machines for n!, n*n.
8. Turning Post Correspondence problem, Unsolvability of the halting 08
Machines problems.
Total=48

Recommended Books:
1. Daniel A. Cohen, Introduction to Computer Theory, John Wiley and Sons (1996)
2. Hopcroft John E., Ullman Jeffrey D. and Motwani R., Introduction to Automata Theory,
Languages and Computation, Pearson Education (2006).
3. Michael Sipser, Introduction to the Theory of Computation, Thomson (2007).
4. Lewis Harry R., Elements of Theory of Computation, PHI (1997).
5. K.L.P. Mishra, N. Chandrasekaran, “Theory of Computer Science: Automata.

94

You might also like