Академический Документы
Профессиональный Документы
Культура Документы
I. COURSE OVERVIEW:
Formal languages and automata theory deals with the concepts of automata, formal languages, grammar,
computability and decidability. The reasons to study Formal Languages and Automata Theory are Automata
Theory provides a simple, elegant view of the complex machine that we call a computer. Automata Theory
possesses a high degree of permanence and stability, in contrast with the ever-changing paradigms of the
technology, development, and management of computer systems. Further, parts of the Automata theory
have direct bearing on practice, such as Automata on circuit design, compiler design, and search
algorithms; Formal Languages and Grammars on compiler design; and Complexity on cryptography and
optimization problems in manufacturing, business, and management. Last, but not least, research-oriented
students will make good use of the Automata theory studied in this course.
II. PREREQUISITES:
1|Page
First mid term examination shall be conducted for the first two and half
units of syllabus and second midterm examination shall be conducted for
the remaining portion.
V.COURSE OUTCOMES
II.To illustrate finite state machines to b)To Design Finite Automata‘s for different Regular BL 3,4&5
Expressions and Languages
solve problems in computing
III.To explains the hierarchy of problems c)To Construct context free grammar for various BL 6
VI.To familiarize Regular grammars, d)To solve various problems of applying normal form BL6
techniques, push down automata and Turing
context frees grammar.
Machines
Leve
Program Outcomes l Proficiency
assessed by
a H Lectures,
An ability to apply the knowledge of mathematics, Computing, Science and engineering to
solve Computer Science and Engineering problems.
Assgnments,
Graduates will demonstrate an ability to visualize and work on laboratory and Multi
d N --
Graduate will develop confidence for self education and acquire new knowledge in the
computing discipline and ability and practice for Multi-disciplinary tasks as a member within
i the teams S Assignments,
Exercises
j
To communicate effectively N --
An ability to use the techniques, skills and modern engineering tools necessary for
k Engineering practice H Assignments,
Exercises
Graduates are able to participate and succeed in competitive examination like GRE, GATE,
TOEFL, GMAT etc.
l N
N
The use of current application software and the design and use of operating systems and the
analysis, design, testing and documentation of computer programs for the use in Computer
Science and engineering technologies.
m
n An ability to setup an enterprise N
N= None S= Supportive H = Highly Related
VII.SYLLABUS:
UNIT - I
FINITE AUTOMATA (FA): Introduction, Deterministic Finite Automata (DFA) -Formal definition, simpler notations (state
transition diagram, transition table), language of a DFA. Nondeterministic Finite Automata (NFA)- Definition of NFA, language
of an NFA, Equivalence of Deterministic and Nondeterministic Finite Automata, Applications of Finite Automata, Finite
Automata with Epsilon Transitions, Eliminating Epsilon transitions, Minimization of Deterministic Finite Automata, Finite
automata with output (Moore and Mealy machines) and Inter conversion .
UNIT - II
REGULAR EXPRESSIONS (RE): Introduction, Identities of Regular Expressions, Finite Automata and Regular
Expressions- Converting from DFA‘s to Regular Expressions, Converting Regular Expressions to Automata,
applications of Regular Expressions. REGULAR GRAMMARS: Definition, regular grammars and FA, FA for
regular grammar, Regular grammar for FA. Proving languages to be non-regular -Pumping lemma, applications,
Closure properties of regular languages.
UNIT - III
CONTEXT FREE GRAMMER (CFG): Derivation Trees, Sentential Forms, Rightmost and Leftmost derivations
of Strings. Ambiguity in CFG‘s, Minimization of CFG‘s, CNF, GNF, Pumping Lemma for CFL‘s, Enumeration of
Properties of CFL ( Proof‘s omitted ).
UNIT – IV
PUSHDOWN AUTOMATA: Definition, Model, Acceptance of CFL, Acceptance by Final State and Acceptance by
Empty stack and its Equivalence, Equivalence of CFG and PDA. TURING MACHINES (TM): Formal definition
and behaviour, Languages of a TM, TM as accepters, and TM as a computer of integer functions, Types of TMs.
UNIT V
RECURSIVE AND RECURSIVELY ENUMERABLE LANGUAGES (REL): Properties of recursive and
recursively enumerable languages, Universal Turing machine, The Halting problem, Undecidable problems about
TMs. Context sensitive language and linear bounded automata (LBA), Chomsky hierarchy, Decidability, Post's
correspondence problem (PCP), undecidability of PCP.
TEXT BOOKS: 1. John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman (2007), Introduction to Automata Theory
Languages andComputation, 3rdedition, Pearson Education, India.
REFERENCE BOOKS: 1. K. L. P Mishra, N. Chandrashekaran (2003), Theory of Computer Science-Automata
Languages and Computation, 2nd edition, Prentice Hall of India, India.
VIII. COURSE PLAN:
The course plan is meant as a guideline. There may probably be changes.
Course Outcomes
Course Objectives
a b c d e
H H S S H
I
S S H S S
II
S H
III
S H S
VI
Program Outcomes
Course Objectives a b c d e f g h i j k l m n
1 s H S H
2 S H H S
3 H S S H H
H
4 S H S
OBJECTIVE QUESTIONS:
UNIT-1:
UNIT-2:
1. In mo or e machine shows the out put alphabet
a) b) Δ c) Q d) λ
2. 3. A melay machine is a tuple.
a) 4 b) 7 c) 6 d) 5
4. Any given transition graphs has an equivalent
a) DFA b) NFA c) RE d) DFA , N
FA & RE
5. The DFA start state =
a) Closure b) closure c) NFA d) NFA
(NFA (NFA start final
final start state state
state) state)
6. In a moore machine λ is a mapping from to
a) Q , є
b) є, Q
c) Δ , Q
d) Q , Δ
7. The smallest FA which accepted the language L={x| length X is divisible by 3} has
a) 2 States b) 3 States c) 4 States d) 5 States
8. Given an arbitrary NFA with N States ,the maximum number of
states In an equivalent minimized DFA is at least
a) N2 b)N c) N! d)2N
9.But S donate the set of seven bit binary strings in which the first
,the fourth ,and the last bits are 1, the number of strings in S that
are accepted by M is
a) 1 b)2 c)5 d)7
10. Can a DFA simulate NFA?
a) DFA b)NFA c)mealy
d)moore
UNIT-3:
1. In case of regular sets the question is ‘ L1 subset or equal to L2? ’
is
a) Decidabl b) Cant say c) Un d) trivially
e decidable decidable
2. Let r and s are languages R and c) R +
regular S. Then (rs) a) R * d) R U S
expressions denote
denoting the b) R S
3. Let r , s , t are regular expressions . Φ * =
a) Φ b) { Φ } c) { ε } d) ε
4. Consider the following automata as shown in figure 14 for the
above NFA regular
Expression is center line Figure 14
a) 11 * b) 1* c) 1 d) 01*
5. ’The regular sets are closed under union’ is
a) True b) True or c) False d) can‘t say
False
6. L= {an bn an | n = 1 , 2 , 3, - - - - } is an example of a
language that is
a) not also not c) context ent is not
context CF free and CF
free and whose
b) not d) context
complem complem
context free
ent is free
7. Let r, s, t are regular expressions. (ε+ r)* =
a) r * b) ε r c) ε d) r
8. 1 + 01 =
a) ε + 0 b) ( ε + 0 ) c) 1 01 d) 1 ( ε + 0
1 )
9. ‘The regular sets are
b) closed
True under kleene closure’ is d) False
a) can’ t say c) True or
False
10. Let L1 be 0*10 * and L2 be 10*1 The quotient of L1 and L2 is
a) empty b) 1 c) 10* d) 0 *
UNIT-4:
UNIT-5:
b) vi xi
c) u vi w xi
d) u vi w xi
3. A CFL for which every CFG is ambiguous is said to be an
ambiguous----- CFL.
a) inherentl b) inequal c) implicitl d) Explicitl
y y y
δ(q1,1,x) = (q1,ϵ)
δ(q1,ϵ,x)=(q1,ϵ)
δ(q1,ϵ,z0)=(q1,ϵ)
UNIT - IV
1 Construct a Turing Machine that accepts the language Apply 12
L = {a2nbn| n ≥0}. Give the transition diagram for the
Turing Machine obtained.
2 Construct a Turing Machine that gives two’s compliment for the Apply 12
given binary representation.
3 Construct a Turing Machine to accept the following language. Apply 12
L = { wnxnynzn | n ≥1}
4 Construct a Turing Machine which shift non block symbols 2 cells Apply 12
to the right.
UNIT - V
1 Explain PCP and MPCP with examples. Understand 13
2 Explain Turing theorem ,Halting problems, Turing Reducibility. Understand 13
3 Construct LR(0) for Apply 5
S E
E E*B
E E+B
E id
4 Construct LR(0) for Apply 5
A aAa/B
B b
ASSIGNMENT QUESTIONS:
ASSIGNMENT - I
Blooms
Course
S. No. Question Taxonomy
Outcome
Level
UNIT – II
Explain Identity rules. Give an example using the identity rules for the
1
simplification
Remember 1
2 Construct Regular grammar for the given Finite Automata Apply 2
Convert given Finite Automat to Regular Expression using standard
3 method(RijK method) Understand 2
4 Convert Regular Expression ab* + b to Finite Automata. Understand 2
5 Convert given Finite Automat to Regular Expression using Arden’s theorem. Understand 2
Use G be the grammar
S aBbA
A a aS bAA B b bS aBB 3
6 For the string aaabbabbba , Apply
Find
a. Leftmost Derivation.
b . Rightmost Derivation.
c. Derivation Tree.
7 Convert Regular Expression (bb + a)*(aa + b)* to NFA with ε. Understand 2
8 Construct Regular Grammars for Finite Automata a*(b (a + b))* . Apply 2
Construct Finite Automata for
A0 a A1
9 Apply 2
A1 b A1
A1 a
A1 bA0.
10 Convert Regular Expression (a + b)*(aa + bb)(a + b)* to DFA. Understand 2
UNIT - III
1 Discuss the Pumping lemma for Context Free Languages concept with Understand 2
example.
2 Show that the following grammar is ambiguous with respect to the string Understand
aaabbabbba.
S aB | bA 3
A aS| bAA| a
B bS | aBB | b
3 Use the following grammar : Apply
S ABC | BbB,
A aA | BaC|aaa
B bBb| a|D
C CA|AC 3
D ε
Eliminate ε-productions.
Eliminate any unit productions in the resulting grammar.
Eliminate any useless symbols in the resulting grammar.
Convert the resulting grammar into Chomsky Normal Form (CNF).
4 Convert the following grammar to GNF Understand
A1 A2 A3 3
A2 A3 A1 /b
A3 A1 A2 /a
5 Write the procedure to convert CFG to PDA and also convert the following Apply
CFG to PDA. PDA.
S aABB | aAA 4
A aBB | a
B bBB | A
C a
6 Construct PDA for equal number of x’s and y’s Apply 4
7 Convert the following PDA to CFG Understand
δ(q0,0,z0)={q0,xz0)
δ(q0,0,x)=(q0,xx)
δ(q0,1,x)=(q1,ϵ)
4
δ(q1,1,x) = (q1,ϵ)
δ(q1,ϵ,x)=(q1,ϵ)
δ(q1,ϵ,z0)=(q1,)
UNIT – IV
1 Construct a Turing Machine to accept the language Apply
L= { wwR | w € ( 0 + 1 ) *} 4
2 Construct a Turing Machine that accepts the language Apply
L = {anbn | n ≥1}. Give the transition diagram for the Turing 4
Machine obtained
3 Construct a Turing Machine which shift non block symbols 2 cells to the Apply 4
right.
4 Construct a Turing Machine that accepts the language L = {0n1n | n ≥1}. Apply 4
Give the transition diagram for the Turing Machine obtained and also
show the moves made by the Turing machine for the string 000111.
5 Define a Turing Machine. With a neat diagram explain the working of a Turing Remember 4
Machine.
6 Define Recursive and Recursively Enumerable languages? Write the properties Remember 4
of recursive and recursively enumerable languages.
7 Construct a Turing Machine that gives two’s compliment for the given Apply
binary representation. 4
8 Construct a Turing Machine that accepts the language Apply
L = {02n1n| n ≥0}. Give the transition diagram for the Turing 4
Machine obtained.
9 Construct a Turing Machine that accepts the language L = {1n2n3n | n ≥1}. Apply
Give the transition diagram for the Turing Machine obtained and also 4
show the moves made by the Turing machine for the string 111222333.
10 Construct a Turing Machine to implement Subtraction (m-n ). Apply 4
UNIT – V
1 Explain the concept of undecidability problems about Turing Machine Remember 1
2 Write a short notes on Context sensitive language and linear bounded Apply
automata 1
3 Explain individually classes P and NP Remember 5
4 Write a shot notes on post's correspondence problem Apply 5
5 Explain the Halting problem with an example. Write short notes on universal Apply
Turing machine. 5
6 Construct LR(0) for Apply
A aAa/B 5
B b
7 Write a short notes on Chomsky hierarchy Apply 1
8 Write a note on Modified PCP and Multi stack Turing machine. Apply 4
9 Write a short notes on NP complete , NP hard problems Apply 5
10 Construct LR(0) for Apply
S E
E E*B 5
E E+B