ACADEMY OF TECHNOLOGY

QUESTION BANK
FORMAL LANGUAGE AND AUTOMATA THORY (PCC CS403)
4TH SEM CSE
Faculty Name: Dr. Partha Ghosh & Prof. Uday Kumar Mondal
Course Outcomes (CO): At the end of this module the students will be able to

CO No. Outcome Bloom’s Taxonomy Level

CO1 To define finite automata and its classification ● L1 (Remembering)

and perform their conversion and minimization ● L2 (Understanding)
of finite automata. ● L3 (Applying)

CO2 To define finite automata with output and its ● L1 (Remembering)

classification and to define mealy and moore ● L2 (Understanding)
machine and perform their conversion ● L3 (Applying)
● L4 (Analyzing)

CO3 To define Language and grammar and their ● L1 (Remembering)

conversions. To classify different types of ● L2 (Understanding)
language and grammar. ● L3 (Applying)
● L4 (Analyzing)

CO4 To implement finite automata for regular (type- ● L1 (Remembering)

3) grammar and to evaluate regular ● L2 (Understanding)
expressions. ● L3 (Applying)
● L4 (Analyzing)

CO5. To implement pushdown automata for context ● L1 (Remembering)

free (type-2) grammar. And to construct parse ● L2 (Understanding)
tree for checking ambiguity. ● L3 (Applying)
● L4 (Analyzing)

CO6 To implement Turing machines for type-0 ● L1 (Remembering)

grammar. ● L2 (Understanding)
● L3 (Applying)

Question:
MODULE 1: Introduction
BLOOM’S TEXANOMY LEVEL: 1 (Remembering)

SL NO QUESTIONS MARK CO
S NO
1 What is the Chomsky hierarchy of languages? 5 1,3

2 What does the term "automata" refer to in the context of computer 1 1

science?
A) Software programs
B) Formal languages
C) Mathematical models of computation
 D) Hardware components

3 In the context of formal languages, what does an "alphabet" 1 1

represent?
A) Set of symbols used to construct strings
B) Set of strings generated by a grammar
C) Set of states in an automaton
D) Set of rules for language derivation
4 Which of the following is not a component of a formal language? 1 1
A) Alphabet B) Syntax C) Semantics D) Production rules

5 What is the purpose of production rules in formal grammars? 1 1

A) To define the alphabet
B) To generate strings in the language
C) To determine the semantics of the language
D) To describe the automaton

BLOOM’S TEXANOMY LEVEL: 2 (Understanding)

SL NO QUESTIONS MARK CO
S NO
1 Describe the relationship between automata and formal languages. 5 1

2 Explain the concept of an alphabet in the context of formal languages 5 1

and grammars, and discuss its importance in defining the set of
symbols used for constructing strings
3 Which of the following represents the Chomsky hierarchy of languages? 1 1,3
A) Regular, Context-Free, Context-Sensitive, Recursively Enumerable
B) Regular, Context-Free, Regular, Recursively Enumerable
C) Context-Free, Regular, Context-Sensitive, Recursively Enumerable
D) Context-Free, Regular, Recursively Enumerable, Context-Sensitive
4 Which of the following grammars is the most powerful in terms of 1 1,3
expressive power?
A) Regular grammar
B) Context-free grammar
C) Context-sensitive grammar
D) Type-0 grammar

MODULE 2: Regular languages and finite automata

BLOOM’S TEXANOMY LEVEL: 1 (Remembering)

SL NO QUESTIONS MARK CO
S NO
1 Define trap / dead state of DFA. Explain with example. 5 1
2 Define DFA with example 5 1

3 What are the differences between DFA and NFA 5 1

4 In DFA, transition function maps. 1 1

a) Σ × Q -> Σ
b) Q × Q -> Σ
c) Σ × Σ -> Q
d) Q × Σ -> Q
5 In NFA, transition function maps. 1 1
a) Σ × Q --> Σ
b) Q × Q --> Σ
c) Q × {Σ ∪ ˄} --> 2Q
d) Q × Σ --> Q
6 There are ________ tuples in finite state machine. 1 1
a) 4
b) 5
c) 6
d) unlimited
7 Define MOORE machine with example 5 1

8 Define Mealy machine with example 5 1

9 There are ________ tuples in Mealy machine. 1 1

a) 4
b) 5
c) 6
d) unlimited
10 State pumping Lemma for regular language. 3 1

11 State Arden's theorem for regular expression 3 2

BLOOM’S TEXANOMY LEVEL: 2 (Understanding)

SL NO QUESTIONS MARK CO
S NO
1 If S is the number of states in NDFA then equivalent DFA can 1 1
have maximum of
(a) S states (b) S - 1 state
s
(c) 2 states (d) 2s – 1 states

2 NFA, in its name has ’non-deterministic’ because of : 1 1

a) The result is undetermined
 b) The choice of path is non-deterministic
c) The state to be transited next is non-deterministic
d) All of the mentioned

What is wrong in the given definition? 1 1

3 Def: ({q0, q1, q2}, {0,1}, δ, q3, {q3})
A) The definition does not satisfy 5 Tuple definition of NFA
B) There are no transition definition
C) Initial and Final states do not belong to the set of states.
D) Initial and final states can’t be same
4 1 1
What is the relation between DFA and NFA on the basis of
computational power?
A) DFA > NFA
B) NFA > DFA
C) Equal
D) Can’t be said
5 Construct a DFA that accept the Language “The set of all string not 3 1
containing the substring 010” over the alphabet Σ = {0,1};

6 Draw a transition diagram of a state automation A that accepts the given 3 1

set of strings over ∑=( a, b).

a) even number of a s and

b) exactly one b.

7 The DFA: 1 1

Accepts the string:

a) 10000011
b) 10010000
c) 11101111
d) None of these

8 The DFA: 1 1

Accepts:
a) Odd number of 0
b) Even number of 1
c) Even number of 0
d) Even number of 0 and Even number of 1
9 Number of states require in a DFA to accept string ends with 10. 1 1
A) 3
B) 2
C) 1
D) can’t be represented.
10 Extended transition function is . 1 1
a) Q * Σ* -> Q
b) Q * Σ -> Q
c) Q* * Σ* -> Σ
d) Q * Σ -> Σ
11 δ*(q,ya) is equivalent to . 1 1
a) δ((q,y),a)
b) δ(δ*(q,y),a)
c) δ(q,ya)
d) independent from δ notation
12 String X is accepted by finite automata if . 1 1
a) δ*(q,x) E A
b) δ(q,x) E A
c) δ*(Q0,x) E A
d) δ(Q0,x) E A
11 Finite automata requires minimum _______ number of stacks. 1 1
a) 1
b) 0
c) 2
d) None of the mentioned
12 The basic limitation of finite automata is that 1 1
a) It can’t remember arbitrary large amount of information.
b) It sometimes recognize grammar that are not regular.
c) It sometimes fails to recognize regular grammar.
d) All of the mentioned
13 Design a FA with ∑ = {0, 1} accepts those string which 4 2
starts with 1 and ends with 0.
14 Design FA with ∑ = {0, 1} accepts even number of 0's and 4 1
even number of 1's.
15 Design FA with ∑ = {0, 1} accepts the set of all strings with 4 1
three consecutive 0's
16 Design an NFA in which all the string contain a substring 4 1
1110.
17 Number of states require in a DFA to accept string anbn, where n>0. 1 1
a) 3
b) 2
c) 6
d) can’t be represented.
18 Number of states require in a DFA to accept string ends with 101. 1 1
a) 3
b) 2
c) 4
d) can’t be represented.
19 Number of states require in a DFA to accept string starts with 1 1
aaa.
a) 6 b) 5 c) 4 d) can’t be represented.
 20. Using the pumping Lemma prove that L ={an bn | n>=1} is not 4 1
regular.

BLOOM’S TEXANOMY LEVEL: 3 (Applying)

SL NO QUESTION MA CO
RKS NO
1 Convert the given NFA to DFA. 5 1

2 Convert the Mealy Machine ( given below ) to a Moore Machine. 4 2

Present NextState i/p=o Next state i/p=1

State State Output State Output
Q1 Q2 1 Q1 0
Q2 Q3 0 Q4 1
Q3 Q1 0 Q4 0
Q4 Q3 1 Q2 1

3 Use Myhill-Nerode theorem to minimize the FA shown below: 4 1

4 Convert the given NFA to DFA. 4 1

5 5 1
Design a DFA over ∑ ={a,b} that accepts string having even number of a and odd number
of b.

6 5 1
Design a DFA over ∑ ={0,1} that accepts string ends with 101.

7 Design a DFA over ∑ ={a,b} that accepts string having anbm , where n,m>0 5 1

8 Design a DFA over ∑ ={0,1} that accepts number divisible by 3. 5 1

9 Design a DFA over ∑ ={a,b} that accepts language L={ w, where |w| mod 3=0 } 5 1
10 Design a DFA over ∑ ={a,b} that accepts string aab exactly. 5 1
11 Design a DFA over ∑ ={a,b} that accepts string having odd number of a 4 1
12 Design a DFA over ∑ ={a,b} that accepts string having even number of b 4 1
13 Design a DFA over ∑ ={a,b} that accepts string abn , n>0 5 1
14 Design a DFA over ∑ ={0,1} that accepts string containing at least one 0 and one 1. 5 1
15 Design a DFA over ∑ ={a,b} that accepts string ab2w, where w ∈ {a,b}* 5 1
16 Design a DFA over ∑ ={a,b} that accepts substring aab. 4 1
17 Consider the following two DFA: 5 1
 Check these two are equivalence or not.

18. Minimize the DFA using Myhill-Nerode theorem 5 1

19 Minimize the DFA using Myhill-Nerode theorem 5 1

20 Convert the following NFA with ε to NFA without ε. 3 1

21 Convert the NFA to RE using Arden’s theorem 5 1

22 Convert the NFA/DFA to RE using Arden’s theorem 5 1

23 Convert the RE to DFA 5 1

a*(a+b)b*

24 Convert the RE to NFA/DFA 5 1

(0+1)*(00+11)(0+1)*

25 Design a DFA over ∑ ={a,b} that accepts string having a n bm , 5 1

where n,m>0.
BLOOM’S TEXANOMY LEVEL: 4 (Analyzing)

SL NO QUESTIONS MARKS CO
NO
1 Analyze Myhill-Nerode theorem and its applications in 5 2
formal language theory, particularly in determining the
equivalence of languages and minimizing finite automata.
Provide examples to illustrate its uses.
2 Determine the pumping length for a regular language 5 1
defined by a regular expression with m symbols using the
pumping lemma.

MODULE 3: Context-free languages and pushdown automata

BLOOM’S TEXANOMY LEVEL: 1 (Remembering)

SL QUESTIONS MARKS CO
NO NO
1 Explain the concept of a pushdown automaton (PDA) and 5 5
its components.

2 Illustrate with an example how a PDA operates and 4 5

processes input strings.

3 Which forms are used to standardize the representation of 1 5

context-free grammars?
A) Chomsky and Greibach normal forms
B) Turing and Kuroda normal forms
C) Backus-Naur and EBNF forms
D) Goto and Backus normal forms
4 What is the equivalence between nondeterministic 1 5
pushdown automata (PDA) and context-free grammars
(CFG)?
A) NPDA can accept a superset of languages accepted by
CFG.
B) CFG can accept a superset of languages accepted by
NPDA.
C) NPDA and CFG can accept the same set of
languages.
D) NPDA and CFG are entirely unrelated in terms of
language recognition.
5 What is parse trees? Provide an example. 4 5

6 Define context-free languages (CFLs) and explain their 4 5

significance in formal language theory.

7 Define closure properties of context-free languages (CFLs)

with respect to various operations such as union,
concatenation, and Kleene star.
BLOOM’S TEXANOMY LEVEL: 2 (Understanding)

SL QUESTIONS MARKS CO
NO NO
1 Which of the following defines a context-free grammar 1 5
(CFG)?
A) A grammar that generates regular languages.
B) A grammar that generates context-sensitive languages.
C) A grammar in Chomsky normal form.
D) A grammar with production rules of the form A → α,
where A is a non-terminal symbol and α is a string of
terminals and non-terminals.
2 What is the purpose of parse trees in the context of context- 1 5
free grammars?
A) To represent the structure of a derivation of a string.
B) To determine whether a string is in the language
generated by the grammar.
C) To minimize the number of states in a pushdown
automaton.
D) To generate strings by applying production rules.
Ambiguity in context-free grammars refers to: 1 5
3 A) The inability to generate certain types of languages.
B) The presence of multiple parse trees for the same
string.
C) The complexity of the language generated by the
grammar.
D) The lack of closure properties in context-free languages.
4 What does the pumping lemma for context-free languages 1 5
state?
A) It provides a method for parsing ambiguous context-free
grammars.
B) It proves that every context-free language is regular.
C) It establishes the closure properties of context-free
languages.
D) It identifies certain properties of context-free
languages regarding string lengths.
5 Which of the following accurately describes a deterministic 3 5
pushdown automaton (DPDA)?
A) A DPDA can process strings in reverse order compared
to an NPDA.
B) A DPDA may have multiple transitions for the same
input-symbol and state combination.
C) A DPDA always has a unique next move given its
current configuration.
D) A DPDA can recognize non-context-free languages.
6 What are the closure properties of context-free languages? 1 5
A) They define the behavior of context-free grammars when
applied to regular languages.
B) They describe the effect of operations such as union,
concatenation, and Kleene closure on context-free
languages.
C) They determine the number of states required in a
pushdown automaton to recognize a given language.
D) They specify the conditions under which a context-free
language becomes regular.
7 How does non-determinism in pushdown automata affect 1 5
their computational capabilities?
A) It allows them to recognize only regular languages.
B) It enables them to recognize context-sensitive languages.
C) It increases their efficiency in recognizing certain
types of languages.
D) It makes them equivalent in expressive power to
deterministic pushdown automata.
8 Which of the following is not a characteristic of context- 1 5
free languages?
A) They can be recognized by a pushdown automaton.
B) They can be described by context-free grammars.
C) They exhibit ambiguity in their syntax.
D) They are closed under the operation of intersection.
9 Explain the utility of parse trees. 4 5

10 Differentiate between Chomsky and Greibach normal forms 5 5

in the context of context-free grammars (CFGs). Provide
examples illustrating each.
11 Describe the concept of nondeterministic pushdown 5 5
automata (PDA) and explain its equivalence with context-
free grammars (CFGs).
12 Explain the pumping lemma for context-free languages 4 5
(CFLs)

BLOOM’S TEXANOMY LEVEL: 3 (Applying)

SL NO QUESTIONS MARKS CO
NO
1 Show that the following grammar is ambiguous: 5 5
Sa | abSb | aAb
AbS | a AA b

2 Design a PDA for language L = { ancb2n | n ≥ 1) over the 5 5

alphabet {a,b,c}.
Specify the acceptance state.

3 Check whether the grammar is ambiguous or not: 4 5

 S iCtS | iCtSeS | a
Cb

4 . Design a CFG for the language L = { an b2n / n≥0}. 5 5

5 Write the CFG for the language 4 5

L = { 0i 1j 2k | i=j or j=k }.

6 Prove that CFLs are not closed under intersection and 4 5

complement operation.
7 E  E+E | E*E | a 4 5
Prove that the CFG with this production rule is ambiguous.

BLOOM’S TEXANOMY LEVEL: 4 (Analyzing)

SL NO QUESTIONS MARKS CO
NO
1 Compare and contrast nondeterministic pushdown automata 5 5
(NPDA) and deterministic pushdown automata (DPDA),
highlighting their differences in terms of language recognition
capabilities.
2 Consider a context-free grammar (CFG) with the following 5 5
productions:
S → aSb | ε
Analyze the given CFG to determine its language. Provide a detailed
explanation of your analysis.
3 Compare and contrast the closure properties of context-free 5 5
languages (CFLs) with those of regular languages. Discuss similarities
and differences, providing examples to illustrate your points.

MODULE 4: Context-sensitive languages

BLOOM’S TEXANOMY LEVEL: 1 (Remembering)

SL QUESTIONS MARKS CO
NO NO
1 Define context-sensitive languages and provide examples. 3 3

2 Define Linear Bounded Automata (LBA) with diagram. 4 3

3 Linear Bounded Automata (LBA) are limited in their tape 1 3

space to:
a) Linear space b) Quadratic space
c) Logarithmic space d) Constant space
BLOOM’S TEXANOMY LEVEL: 2 (Understanding)

SL QUESTIONS MARKS CO
NO NO
1 Which of the following is NOT a closure property of 1 3
context-sensitive languages?
a) Closure under union
b) Closure under intersection
c) Closure under concatenation
d) Closure under complement
2 Linear Bounded Automata (LBA) are equivalent in power 1 3
to which of the following?
a) Context-free grammars b) Regular expressions
c) Context-sensitive grammars d) Turing machines
The emptiness problem for linear bounded automata is: 1 3
3 a) Decidable b) Undecidable
c) Semi-decidable d) None of the above
4 Discuss the closure properties of context-sensitive 3 3
languages under union, concatenation, and intersection.
5 Explain the concept of Linear Bounded Automata (LBA) 4 3
and its significance in recognizing context-sensitive
languages.
6 Which of the following is true for the language {ap│p is a 1 3
prime}?
(a) It is not accepted by a Turing machine
(b) It is regular but not context- free
(c) It is context free but not regular
(d) it is neither regular nor context free ,but accepted by
a Turing machine.

BLOOM’S TEXANOMY LEVEL: 3 (Applying)

SL NO QUESTIONS MARKS CO
NO
1 Design a LBA for language L = { anbncn | n ≥ 1) over the 5 3
alphabet {a,b,c}.
2 Design a LBA for language L = {an | n = m2, m ≥ 1}, 5 3
means n is perfect square.

3 Design a LBA for language L = {an | n is prime} 5 3

MODULE 5: Turing machines
BLOOM’S TEXANOMY LEVEL: 1 (Remembering)

SL QUESTIONS MARKS CO
NO NO
1 Which of the following is a characteristic of Turing 1 6
machines (TM)?
a) Finite number of states b) Limited tape alphabet
c) Unbounded tape d) Restricted tape movement
2 A language is Turing-recognizable if: 1 6
a) It can be generated by a context-sensitive grammar
b) A Turing machine halts and accepts all inputs
c) It is recursively enumerable
d) It is regular
3 Define Turing machine with an example. 5 6
4 Define nondeterministic Turing machine 4 6

BLOOM’S TEXANOMY LEVEL: 2 (Understanding)

SL QUESTIONS MARKS CO
NO NO
1 Turing machines are capable of simulating which of the 1 6
following?
a) Finite automata
b) Pushdown automata
c) Both finite and pushdown automata
d) Neither finite nor pushdown automata
2 A language is Turing-decidable if: 1 6
a) It can be recognized by a Turing machine
b) It can be generated by a context-sensitive grammar
c) A Turing machine halts and accepts or rejects all
inputs
d) It is recursively enumerable
Explain the difference between Turing-recognizable 4 6
3 (recursively enumerable) and Turing-decidable (recursive)
languages.
4 Prove or disprove the equivalence between nondeterministic 4 6
Turing machines and deterministic Turing machines in
terms of language recognition.
5 Discuss the relationship between unrestricted grammars and 4 6
Turing machines. Explain how unrestricted grammars can
generate languages recognized by Turing machines.
6 Discuss real-world applications of Turing machines or their 5 6
variants. Explain how Turing machines or their concepts are
used in computational theory or practical computing
systems.
7 Explain the concept of a Multi-tape Turing machine. 5 6
BLOOM’S TEXANOMY LEVEL: 3 (Applying)

SL NO QUESTIONS MARKS CO
NO
1 Construct a Turing Machine for language L = {ww | w ∈ 5 6
{0,1}}
2 Design Turing machine for language L = { anbncn | n ≥ 1) 5 6
over the alphabet {a,b,c}.
3 Design Turing machine for language L = { anbn | n ≥ 1) 5 6
over the alphabet {a,b}.
4 Construct TM for the addition function for the unary 4 6
number system.
5 Construct a TM machine for checking the palindrome of 5 6
the string of odd length.
6 Construct a TM machine for checking the palindrome of 5 6
the string of even length.
7 Construct a TM over the alphabet {0,1,2} for the 5 6
language L = {0n1n2n}, where n≥1

BLOOM’S TEXANOMY LEVEL: 4 (Analyzing)

SL NO QUESTIONS MARKS CO
NO
1 Compare and contrast Deterministic Turing machines and 5 6
Nondeterministic Turing machines.
2 Compare and contrast Multi-tape Turing machines with 5 6
standard single-tape Turing machines, discussing their
advantages and limitations.

MODULE 6: Undecidability
BLOOM’S TEXANOMY LEVEL: 1 (Remembering)

SL QUESTIONS MARKS CO
NO NO
1 What is the Church-Turing thesis? 4 3

2 Discuss the concept of universal Turing machines. 4 3

3 Define a universal Turing machine. 4 3

4 What are undecidable problems? 4 3
5 Provide an example of an undecidable problem about 3 3
languages.
BLOOM’S TEXANOMY LEVEL: 2 (Understanding)

SL QUESTIONS MARKS CO
NO NO
1 Describe the construction and operation of a universal 5 3
Turing machine. Explain how a universal Turing machine
can simulate any other Turing machine.
2 Explain the Church-Turing thesis and its significance in the 4 3
theory of computation.
Define the concept of universal and diagonalization 4 3
3 languages
4 Discuss the implications of undecidability results for 4 3
practical computing and algorithm design.
5 Explain how undecidability influences the development of 4 3
algorithms and the limitations of automated reasoning
systems.
6 Discuss the implications of undecidability results for 4 3
practical computing and algorithm design.