THEORY OF AUTOMATA AND FORMAL LANGUAGES (KCS-402) 2020-21

THEORY OF AUTOMATA AND FORMAL LANGUAGES (KCS-402)

Theory of Automata and Formal
Languages (KCS402)
Course Outcome ( CO)
At the end of course , the student will be
able to understand
Analyse and design finite automata, pushdown automata, Turing machines, formal languages, and
CO 1
grammars
CO 2 Analyse and design, Turing machines, formal languages, and grammars

Demonstrate the understanding of key notions, such as algorithm, computability, decidability, and
CO 3
complexity through problem solving
CO 4 Prove the basic results of the Theory of Computation.

CO 5 State and explain the relevance of the Church-Turing thesis.

DETAILED SYLLABUS

Unit Topic

Basic Concepts and Automata Theory: Introduction to Theory of Computation- Automata,

Computability and Complexity, Alphabet, Symbol, String, Formal Languages, Deterministic Finite
I Automaton (DFA)- Definition, Representation, Acceptability of a String and Language, Non
Deterministic Finite Automaton (NFA), Equivalence of DFA and NFA, NFA with ε-Transition,
Equivalence of NFA’s with and without ε-Transition, Finite Automata with output- Moore Machine,
Mealy Machine, Equivalence of Moore and Mealy Machine, Minimization of Finite
Automata, Myhill-Nerode Theorem, Simulation of DFA and NFA
Regular Expressions and Languages: Regular Expressions, Transition Graph, Kleen’s Theorem, Finite
II Automata and Regular Expression- Arden’s theorem, Algebraic Method Using Arden’s Theorem,
Regular and Non-Regular Languages- Closure properties of Regular Languages, Pigeonhole Principle,
Pumping Lemma, Application of Pumping Lemma, Decidability- Decision properties, Finite Automata
and Regular Languages, Regular Languages and Computers,
Simulation of Transition Graph and Regular language.

Regular and Non-Regular Grammars: Context Free Grammar(CFG)-Definition, Derivations,

Languages, Derivation Trees and Ambiguity, Regular Grammars-Right Linear and Left Linear
III grammars, Conversion of FA into CFG and Regular grammar into FA, Simplification of CFG, Normal
Forms- Chomsky Normal Form(CNF), Greibach Normal Form (GNF), Chomsky
Hierarchy, Programming problems based on the properties of CFGs.

Push Down Automata and Properties of Context Free Languages: Nondeterministic Pushdown
Automata (NPDA)- Definition, Moves, A Language Accepted by NPDA, Deterministic Pushdown
IV Automata(DPDA) and Deterministic Context free Languages(DCFL), Pushdown Automata for Context
Free Languages, Context Free grammars for Pushdown Automata, Two stack Pushdown Automata,
Pumping Lemma for CFL, Closure properties of CFL, Decision Problems of CFL,
Programming problems based on the properties of CFLs.

Turing Machines and Recursive Function Theory : Basic Turing Machine Model, Representation
V of Turing Machines, Language Acceptability of Turing Machines, Techniques for Turing Machine
Construction, Modifications of Turing Machine, Turing Machine as Computer of Integer Functions,
Universal Turing machine, Linear Bounded Automata, Church’s Thesis, Recursive and Recursively
Enumerable language, Halting Problem, Post’s Correspondance
Problem, Introduction to Recursive Function Theory.

0 University Academy
 THEORY OF AUTOMATA AND FORMAL LANGUAGES (KCS-402) 2020-21

THEORY OF AUTOMATA AND FORMAL LANGUAGES (KCS-402)

Solved MCQ
1. Unit-1 …………………………………………………………………………...…….2

2. Unit-2 …………………………………………………………………………...…….8

3. Unit-3…………………………………………………………………………...…... 17

4. Unit-4…………………………………………………………………………..…….24

5. Unit-5………………………………………………………………………......…….30

1 University Academy
 THEORY OF AUTOMATA AND FORMAL LANGUAGES (KCS-402) 2020-21

THEORY OF AUTOMATA AND FORMAL LANGUAGES (KCS-402)

Unit-1

1. Which of following is true? 4. What is a dump state?

1. For every finite language, there exists a a) A state in DFA whose removal will
DFA which accepts the language. not change the language accepted by
2. For some finite language, there does not DFA.
exist a DFA which accepts the language.
b) A state in DFA from where cannot
3. Only finite languages are accepted by
goto any other state.
DFAs.
c) A state in DFA from where we cannot
4. Every infinite language is accepted by
goto any accept state.
some DFA.
2. DFA has
d) A state in DFA reachable by every

A. infinitely many state but finitely many other state.

accept states.
B. finitely many states.
5. Which of following are true?
C. transition function with finite domain and
A. NFA may have ϵ transitions but DFA does
range.
not.
D. transition function with possibly infinite
B. NFA and DFA both may have ϵ
range or domain
transitions.
C. NFA computes on multiple paths but not
a) Only A and B simultaneously.

b) Only B and C D. NFA computes on multiple paths

c) Only A ,B, and C simultaneously
d) All a) Only A and B
3. Which of the following language is accepted the b) Only A and C
given DFA? c) Only A ,B, and C
d) All

6. Which of following languages are accepted by

the given DFA?

a) ϕ
b) Σ*− {x|x ∈ Σ∗ and |x| > 0}
c) Σ* − {0, 1}
d) {0, 1} A. All binary strings of even length.
B. All binary strings with odd difference

2 University Academy
 THEORY OF AUTOMATA AND FORMAL LANGUAGES (KCS-402) 2020-21

between number of 0 and number of 1. vice-versa

C. All binary strings of odd length.
D. All binary strings with even difference
between number of 0 and number of 1. 10. Which of following is true?
a) Only A and B a) A language accepted by a
b) Only B and C regular expression is also
c) Only C and D accepted by some NFA and
d) All some DFA.
b) A language accepted by a
7. Which of following languages are accepted by regular expression is also
the given DFA? accepted by some NFA but not
necessarily accepted by a DFA.
c) A language accepted by a
regular expression is may not be
accepted by any NFA or DFA.
a) {w ∣ w ends with 0} d) A language accepted by a
b) {w ∣ w contains equal number of 0 and 1} regular expression is accepted
c) {w ∣ w does not end with 1}
by some DFA but not
d) {w ∣ w contains 1 and ends with a 0}
necessarily accepted by an NFA.

8. Which of following is true?

11. Regular languages are closed over
a) Every NFA is a set of some DFAs
a) concatenation
b) NFA is a 6 tuple
b) union
c) Every DFA is an NFA
c) intersection
d) Every NFA is a DFA
d) complement
e) All of above
9. Which of following is true?
12. Which of following is true?
a) A language accepted by a DFA is
a) For every regular language there
also accepted by some NFA and
exists a GNFA with atmost 2 states
vice-versa
that accepts the language
b) A language accepted by an NFA is
b) Every GNFA can be converted to a
also accepted by some DFA but not
regular expression such that both
vice-versa
accept same language
c) DFA is 5-tuple but not NFA
c) Every NFA can be converted to a
d) A language accepted by a DFA is
regular expression such that both
also accepted by some NFA but not
3 University Academy
 THEORY OF AUTOMATA AND FORMAL LANGUAGES (KCS-402) 2020-21

accept same language 16. The appropriate precedence order of

d) All of above operations over a Regular Language is

a) Kleene, Union, Concatenate
b) Kleene, Star, Union
13. What is the language accepted by following c) Kleene, Dot, Union
regular expression? d) Star, Union, Dot
0*(1( 01* 0)*1)*0*0 17. If ∑= {0,1}, then Ф* will result to:
a) ε
a) Binary representation of multiples of 6 b) Ф
b) Binary representation of multiples of 4 c) ∑
c) Binary representation of multiples of 3 d) None of the mentioned
d) Binary representation of multiples of 2 18. Under which of the following operation, NFA
is not closed?
a) Negation
14. Let N be a NFA such that starting state of b) Kleene
N is not an accepting state. What is the c) Concatenation
minimum length string that can accepted d) None of the mentioned
a) Length of the shortest path from 19. Which of the following options is correct?

starting state to some accepting Statement 1: Initial State of NFA is Initial

State of DFA.
state
Statement 2: The final state of DFA will be
b) |Q| − 1, Where Q is the set of
every combination of final state of NFA.
states of N
a) Statement 1 is true and Statement 2 is true
c) 1
b) Statement 1 is true and Statement 2 is false
d) 0 c) Statement 1 can be true and Statement 2 is
true
d) Statement 1 is false and Statement 2 is also
15. Consider the grammar G,
false
S → AB
20. What is wrong in the given definition?
A → aa ∣ ab ∣ ba ∣ bb
B → aBa ∣ bBb ∣ C Def: ({q0, q1, q2}, {0,1}, δ, q3, {q3})

C → aa ∣ ab ∣ ba ∣ bb a) The definition does not satisfy 5 Tuple

which of the following string is generated by definition of NFA
G? b) There are no transition definition
c) Initial and Final states do not belong to the
a) bababbab Graph (set of states)
b) abaab d) Initial and final states can’t be same
c) aaabbbba 21. Reverse of a DFA can be formed by
d) babaa a) using PDA
b) making final state as non-final

4 University Academy
 THEORY OF AUTOMATA AND FORMAL LANGUAGES (KCS-402) 2020-21

c) making final as starting state and starting c) Always 1

state as final state d) none
d) None of the mentioned 28. Automata with Boolean output
22. For a give Moore Machine, Given a) moore m/c
Input=’101010’, thus the output would be of b) mealy m/c
length: c) DFA
a) |Input|+1 d) none
b) |Input| 29. Automata can be defined by using
c) |Input-1| a) 4 tuples
d) Cannot be predicted b) 5 tuples
23. Transition Function of NFA is given by ___ c) 3 tuples
a) ∑ x Q → ∑ d) 2 tuples
b) Q x ∑ → ∑ 30. Any Language have string which of length
c) Q x ∑ → Q <=3 and start with 0 and end with 1 over
d) Q x ∑ → 2Q {0,1} then find the number of string in this
24. Which one of the following is TRUE? language?
a) The Language L = {an bn| n >= 0 } is a) 4
regular b) 3
b) The Language L = {an | n is prime } is c) 2
regular d) 1
c) The Language L = { w | w over ∑ = {a, b} 31. Under which of the following operation, NFA
has number of b multiple of 5 } is regular is closed?
d) The language L { ww | w ϵ ∑* with ∑ = a) Negation
{0, 1} } is regular b) Kleene
c) Concatenation
25. ϵ-transitions are
d) All of the above
a) conditional
32. Which of the following is an application of
b) unconditional
Finite Automaton?
c) input dependent
a) Compiler Design
d) none of the mentioned
b) Grammar Parsers
26. Length of null string is
c) Text Search
a) 0
d) All of the mentioned
b) 1
33. NFA, in its name has ’non-deterministic’
c) 2
because of :
d) Not defined
a) The result is undetermined
27. Length of any string w is
b) The choice of path is non-deterministic
a) Unique number of input symbol in that
c) The state to be transited next is non-
string
deterministic
b) Number of input symbol in that string
d) All of the mentioned

5 University Academy
 THEORY OF AUTOMATA AND FORMAL LANGUAGES (KCS-402) 2020-21

34. Which of the following is a not a part of a) 0

definition of finite automata? b) 1
a) Input alphabet c) 2
b) Transition function d) 3
c) Initial State 41. State true or false? Statement: An NFA can be
d) Output Alphabet modified to allow transition without input
35. Language of finite automata is. alphabets, along with one or more transitions
a) Type 0 on input symbols.
b) Type 1 a) True
c) Type 2 b) False
d) Type 3 42. What is the relation between DFA and NFA
36. Transition function of FA maps.to on the basis of computational power?
a) Σ * Q → Σ a) DFA > NFA
b) Q * Q → Σ b) NFA > DFA
c) Σ * Σ → Q c) Equal
d) Q * Σ → Q d) Can’t be said
37. δˆ tells us the best: 43. Which of the following is not an example
a) how the DFA S behaves on a word u of finite state machine system?
b) the state is the dumping state a) Control Mechanism of an elevator
c) the final state has been reached b) Combinational Locks
d) Kleene operation is performed on the set c) Traffic Lights
38. For a give Mealy Machine, Given d) Digital Watches
Input=’101010’, thus the output would be of 44. Given: ∑= {a, b},L= {xϵ∑*|x is a string
length: combination} ∑^4 represents which
a) |Input|+1 among the following?
b) |Input| a) {aa, ab, ba, bb}
c) |Input-1| b) {aaaa, abab, ε, abaa, aabb}
d) Cannot be predicted c) {aaa, aab, aba, bbb}
d) All of the mentioned
39. Subset Construction method refers to: 45. A ______is a substitution such that h(a)
a) Conversion of NFA to DFA contains a string for each a.
b) DFA minimization a) Closure
c) Eliminating Null references b) Interchange
d) ε-NFA to NFA c) Homomorphism
d) Inverse Homomorphism
40. Given Language: {x | it is divisible by 3}. The
total number of final states to be assumed in
order to pass the number constituting {0, 1} is

6 University Academy
 THEORY OF AUTOMATA AND FORMAL LANGUAGES (KCS-402) 2020-21

Answer Key

Unit-1
Question No. Answer Question No. Answer Question No. Answer

1 a 16 c 31 d
2 b 17 a 32 d
3 b 18 d 33 b
4 c 19 a 34 d
5 b 20 c 35 d
6 c 21 c 36 d
7 c 22 a 37 a
8 c 23 d 38 b
9 d 24 c 39 a
10 a 25 b 40 b
11 e 26 a 41 a
12 d 27 b 42 c
13 a 28 c 42 d
14 d 29 b 44 b
15 a, c 30 b 45 c

7 University Academy