Scribd
Upload
195 views5 pages

Automata Theory T

1. This document outlines the course objectives, modules, and model question paper for an Automata Theory course in the second semester of a postgraduate computer science program. 2. The course objectives are to define mathematical models of computation like finite automata and regular languages, design grammars and recognizers for formal languages, construct pushdown automata and context-free grammars, and understand Turing machines and decidability. 3. The course is divided into four modules that cover finite automata, regular expressions and grammars, context-free grammars and pushdown automata, and Turing machines. The model question paper has two sections testing knowledge of the concepts through definitions and examples.

Uploaded by

Sanjana Karthik Naidu
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
195 views5 pages

Automata Theory T

1. This document outlines the course objectives, modules, and model question paper for an Automata Theory course in the second semester of a postgraduate computer science program. 2. The course objectives are to define mathematical models of computation like finite automata and regular languages, design grammars and recognizers for formal languages, construct pushdown automata and context-free grammars, and understand Turing machines and decidability. 3. The course is divided into four modules that cover finite automata, regular expressions and grammars, context-free grammars and pushdown automata, and Turing machines. The model question paper has two sections testing knowledge of the concepts through definitions and examples.

Uploaded by

Sanjana Karthik Naidu
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/ 5

CBCS-2020 PG Sem- II Automata Theory

SEMESTER -II
AUTOMATA THEORY
THEORY

Programme: PG Max. Hours: 60


Course Code : P20/CSC/DSC/204 Hours per week:4
Course Type : DSC Max. Marks: 100
No. of credits: 4

Course Objective:

1. To define mathematical methods of computing devices, called abstract machines,


namely finite automata.
2. To implement regular languages in applications such as compilers, spelling checkers,
and web browsers.
3. To design grammars and recognizers for different formal languages
4. To construct and use pushdown automata and context-free grammars
5. To construct and use simple turing machines.
6. To understand decidability and enable them to classify basic problems as decidable
or not.

Course Outcomes:

1. To model, compare and analyze different computational models using combinatorial


methods.
2. To acquire a fundamental understanding of the core concepts in automata theory and
formal languages.
3. To classify machines by their power to recognize languages.
4. To employ finite state machines to solve problems in computing.
5. To apply rigorously formal mathematical methods to prove properties of languages,
grammars and automata.
6. To have an overview of how the theoretical study is helpful in designing the compilers.
7. To construct algorithms for different problems and argue formally about correctness on
different restricted machine models of computation.
8. To identify limitations of some computational models and possible methods of proving
them.
9. To define the various categories of languages and grammars in the chomsky hierarchy.
10. To determine the decidability and intractability of computational problems.
11. To determine the computation of problems using turing machine.

Department of Computer Science, St. Francis College for Women, Hyderabad-16


CBCS-2020 PG Sem- II Automata Theory

MODULE I: INTRODUCTION TO FINITE AUTOMATA (15 Hrs)

Fundamentals – alphabets, strings, languages, problems, graphs, trees, Finite State Systems,
definitions, Finite Automaton model, acceptance of strings, and languages, Deterministic finite
automaton and Non deterministic finite automaton, transition diagrams, transition tables,
proliferation trees and language recognizers, equivalence of DFA’s and NFA’s. Finite Automata
with -moves, significance, acceptance of languages, -closure, Equivalence of NFA’s with and
without -moves, Minimization of finite automata, Two-way finite automata, Finite Automata
with output – Moore and Mealy machines.

MODULE II: REGULAR EXPRESSIONS AND REGULAR GRAMMARS (15 Hrs)

Regular Languages: regular sets, regular expressions, identity rules, constructing finite automata
for a given regular expressions, conversion of finite automata to regular expressions. Pumping
lemma of regular sets and its applications, closure properties of regular sets. Grammar
Formalism: Regular grammars–right linear and left linear grammars, equivalence between
regular linear grammar and finite automata, inter conversion, Context free grammar, derivation
trees, sentential forms, right most and leftmost derivation of strings, ambiguity.

MODULE III: CONTEXT-FREE GRAMMARS AND PUSHDOWN AUTOMATA


(15 Hrs)
Context Free Grammars: Simplification of Context Free Grammars, Chomsky normal form,
Greiback normal form, Pumping lemma for context free languages and its applications, closure
of properties of CFL (proofs omitted). Push Down Automata: PDA definition, model, acceptance
of CFL, acceptance by final state and acceptance by empty state and its equivalence. Equivalence
of PDA’s and CFL’s, inter-conversion. (Proofs not required).

MODULE IV: TURING MACHINES (15 Hrs)

Membership Algorithm (CYK Algorithm) for Context Free Grammars. Turing Machine: TM
definition, model, design of TM, computable functions, unrestricted grammars, recursively
enumerable languages. Church’s hypothesis, counter machine, types of Turing machines (proofs
omitted). Linear bounded automata and Context sensitive language. Computability Theory:
Chomsky hierarchy of languages, Introduction to DCFL, DPDA, LR(0) grammar, decidability
and un decidable problems. Definitions of P and NP problems, NP complete and NP hard
problems.

Department of Computer Science, St. Francis College for Women, Hyderabad-16


CBCS-2020 PG Sem- II Automata Theory

Text Books:

J. E. Hopcroft, J. D. Ullman, Introduction to Automata Theory, Languages, and Computation

References:

1. Mishra, Chandrashekaran, Theory of Computer Science


2. G P Saradhi Varma and B. Thirupathi Rao, Theory of computation : formal languages
and automata theory
3. ZviKohav, Niraj K Jha, Switching and Finite Automata Theory
4. Perter Linz, An Introduction to Formal Languages and Automata
5. John C. Martin, Introduction to Languages and the Theory of Computation

Department of Computer Science, St. Francis College for Women, Hyderabad-16


CBCS-2020 PG Sem- II Automata Theory

AUTOMATA THEORY
MODEL QUESTION PAPER
THEORY

Course code: P20/ /CSC/DSC/204 Max. Time: 2 ½ hrs.


Credits : 4 Max. Marks: 60

SECTION - A

I. Answer the following 4 x 10 = 40 M

1. Define formal definition of deterministic finite automata. Draw a DFA to accept strings of
a’s and b’s which do not end with the string abb.
OR
2. a) Explain in detail about conversion of DFA’s to regular expression by eliminating states.
b) convert the following NFA to Regular expression by accepting the strings of 1’s and 0’s
which should contain 110 as substring using state elimination procedure.

3. a) Explain in detail about pumping lemma for regular languages.


b) show that L= {an, b n |n>=0}is not regular.
OR
4. a)Define CFG. Obtain Rightmost and Leftmost derivation for the strings aabbba and baabab
by using the given grammar and draw parse trees.
SAS|€
Aaa|ab|ba|bb

5. Define PDA. Obtain a PDA to accept the language L(M)={WCWR|W€(a+b)*} where wris
reverse of w by final state.
OR
6. a) Explain in detail about Normal forms for Context Free Languages.
b) Find an equivalent grammar in Chomsky Normal Form.
SbA|Ab
AbAA|aS|a
BaBB|bS|b

7. Define Turing Machine. Explain in detail about modifications of basic turing machine model.
OR
8. a) Define Undecidability. Explain in detail about the classes P,NP and NP-Complete problem
b) Differentiate between recursive and recursive enumerable languages.

Department of Computer Science, St. Francis College for Women, Hyderabad-16


CBCS-2020 PG Sem- II Automata Theory

SECTION - B

II. Answer any FIVE 5 x 4 = 20 M

9. Explain in detail about operators of regular expressions.


10. Explain in detail about extending transition function of DFA.
11. Describe about equivalence and minimization of automata with example.
12. Discuss about ambiguity in grammars and languages.
13. Explain in detail about closure properties of context free languages.
14. Briefly explain about deterministic pushdown automata.
15. Explain in detail about church’s hypothesis.
16. Explain in detail about applications of pumping lemma of regular languages

Department of Computer Science, St. Francis College for Women, Hyderabad-16

You might also like