For complete BTECH CSE, AIML, DS subjects tutorials visit : ns lectures youtube channel

Formal Languages And Automata Theory (FLAT)

Unitwise Important Questions
Unit-1
Short answer questions:
1. Define ε –transitions, Kleene closure, the language of NFA, transition function of DFA.
2. Explain transition diagram, transition table with example.
3. Construct a DFA to accept even number of 0’s and also construct DFA to accept
empty language.
4. Explain power of an alphabet?
5. Write transition diagram for DFA accepting string ending with 00 and transition
diagram for DFA to accept exactly one a.
6. Write any four differences between DFA and NFA
7. Give example for Minimize the DFA .

Long answer questions:

1. Define language over an alphabet with examples.Write a DFA to accept set of all
strings ending with 010.
2. Construct a Moore machine to accept the following language.
L = { w |w mod 3 = 0} on ∑ = { 0,1,2}
3. Convert NFA with Ɛ to NFA with an example.
4. Construct NFA for (0 + 1)*(00 + 11)(0 + 1)* and Convert to DFA.
5. Construct NFA for (0 +1)*(00 + 11)(0 + 1)* and Draw the transition table and
transition diagram and example strings.
6. Illustrate given 2 FA‘s are equivalent or not with an example.
7. Construct Mealy machine for (0 + 1)*(00 + 11) and convert to Moore machine.
8. Convert Moore machine to Mealy machine with an example.
9. Construct NFA for (0 + 1)*0(0 + 1)0(0 + 1)* and convert to DFA.
10. Construct NFA for (0 + 1)*010(0 + 1)* and Convert to DFA.
11. Construct NFA with Ɛ for 0*1*12* and Convert to NFA .
12. Explain the steps for the minimization of given DFA with an example.

Unit-2
Short answer questions:
1. Define Regular Languages, Pumping Lemma, Context Free Grammars, ambiguous
grammar.
2. Write the applications of pumping lemma for regular languages.
3. List any two applications of regular expression.
4. Write through an intermediate state whose number is not greater than K-1.
5. Write regular expression for denoting language containing empty string.

Prepared by Chennuri Nagendra Sai (Asst.prof)

 For complete BTECH CSE, AIML, DS subjects tutorials visit : ns lectures youtube channel

6. Differentiate LMD and RMD.

7. State the following grammar is ambiguous. S-> AB|aaB A->a / Aa B->b

Long answer questions:

1. Convert Regular Expression 01* + 1 to Finite Automata.
2. Convert given Finite Automat to Regular Expression using Arden’s theorem.
3. Convert given Finite Automat to Regular Expression using standard method(RijK
method)
4. Explain Identity rules. Give an example using the identity rules for the simplification.
5. Construct Regular grammar for the given Finite Automata.
6. Use G be the grammar
S aB bA
A a aS bAAB b  bS aBB
For the string aaabbabbba ,
Find
Leftmost Derivation, Rightmost Derivation, Derivation Tree.
7. Explain the properties, applications of Context Free Languages
8. Construct right linear and left linear grammars for given Regular Expression.
9. Construct a Transition System M accepting L(G) for a given Regular Grammar G.
10. Discuss the properties of Context free Language. Explain the pumping lemma with
an example.
11. Convert Regular Expression (11 + 0)*(00 + 1)* to NFA with Ɛ.
12. Convert Regular Expression (a + b)*(aa + bb)(a + b)* to DFA.
13. Construct Regular Grammars for Finite Automata 0*(1(0 + 1))* .
14. Construct Finite Automata for
A0  a A1
A1  b A1A1  a
A1  bA0
UNIT 3

Short answer questions:

1. Define Greibach normal form, CNF, PDA, NPDA, nullable Variable.
2. State the symbol is used to label the interior node of the parse tree.
3. Define the language of PDA accepted by final state.
4. List the steps to convert CFG to PDA.
5. Differentiate between deterministic and nondeterministic PDA.
6. State the nullable variables from the following CFG.
SABCa | bD
ABC |b
Bb | ε
CĐ | ε
Dd

Long answer questions:

Prepared by Chennuri Nagendra Sai (Asst.prof)

 For complete BTECH CSE, AIML, DS subjects tutorials visit : ns lectures youtube channel

1. Write a short notes on Chomsky Normal Form and Griebach Normal Form.
2. Show that the following grammar is ambiguous with respect to the string
aaabbabbba.
S aB | bA
A aS| bAA| a
B bS | aBB | b
3. Use the following grammar :
S ABC | BbB
A aA | BaC|aaa
B bBb| a|D
CCA|AC
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
4. Illustrate the construction of Griebach normal form with an example
5. Show that the following CFG ambiguous.
S iCtS | iCtSeS | a
C b
6. Discuss the Pumping lemma for Context Free Languages concept with
example {anbncn where n>0}
7. Write the procedure to convert CFG to PDA and also convert the following CFG
to PDA.
S B | aAA
A aBB | a
B bBB|A
C a
8. Construct a PDA to accept the language L ={ anbn | n >= 1} by a final state.
Draw the graphical representation of the PDA. Also show the moves made by the
PDA for the string aaabbb
9. Construct NPDA for L = { W W R /W ϵ ( 0 + 1)*}
M = ({q1,q2},{0,1}.{R,B,G},δ,q1,R,ϕ}
10. Write the procedure to convert from the given PDA to a CFG. Convert the following
example.
δ(q0,b,z0)={q0,zz0)
δ(q0, b, z)=(q0,zz)
δ(q0, ϵ ,z0)=(q0,ϵ)
δ(q0,a,z) = (q1,z)
δ(q1,b,z)=(q1,ϵ)
δ(q1,a,z0)=(q0,z0)
11. Convert the following grammar into GNF
A1 A2 A3
A2  A3 A1 /b
A3 A1 A2 /a
UNIT 4
Short answer questions:
1. Write the Turing Machine model, List types of TM.
2. Explain Church’s Hypothesis and the moves in Turing Machine.
3. Define Turing Machine, ID of a Turing Machine, Language of Turing Machine
4. Write the difference between Pushdown Automata and Turing Machine.

Prepared by Chennuri Nagendra Sai (Asst.prof)

 For complete BTECH CSE, AIML, DS subjects tutorials visit : ns lectures youtube channel

5. Define Context sensitive language, multi head Turing Machine, multi dimensional
Turing Machine.

Long answer questions:

1. Define a Turing Machine. With a neat diagram explain the working of a Turing
Machine.
2. Construct a Turing Machine which shift non block symbols 3 cells to the right.
3. Construct a Turing Machine to accept the following language. L = { 0n1n0n | n ≥1}
4. Construct a Turing Machine that accepts the language L = {0n1n | n ≥1}. Give the
transition diagram for the Turing Machine obtained and also show the moves made
by the Turing machine for the string 000111.
5. Construct a Turing Machine to accept the language L= { w#wR | w ϵ ( a + b ) *}
6. Write short notes on Recursive and Recursively Enumerable languages?
7. Write the properties of recursive and recursively enumerable languages
8. Construct a Turing Machine to accept strings formed with 0 and 1 and having
substring 000.
9. Construct a Turing Machine that accepts the language L = {1n2n3n | n ≥1}. Give the
transition diagram for the Turing Machine obtained and also show the moves made
by the Turing machine for the string 111222333.
10. Construct a Turing Machine to implement Subtraction ( m-n ).
11. Construct a Turing Machine that gives two’s compliment for the given binary
representation.
12. Construct a Turing Machine to accept the following language.L = { wnxnynzn | n ≥1}
13. Construct a Turing Machine which shift non block symbols 2 cells to the right.

UNIT 5
Short answer questions:
1. Define a)Chomsky hierarchy of languages b)Universal Turing Machine c) LR(0)
grammars d) P,NP problems e) Rice ‘s theorem f) decidability & undecidability
2. Give examples for Undecidable Problems
3. Define a)Turing Machine halting problem b) Turing Reducibility c) PCP.
4. Write a short notes on NP complete , NP hard problems.
5. Explain PCP and MPCP with examples.
6. Explain Turing theorem ,Halting problems, Turing Reducibility.

Long answer questions:

1. Explain the concept of undecidability problems about Turing Machine
2. Write a note on Modified PCP and Multi tape Turing machine.
3. Explain individually classes P and NP
4. Explain the Halting problem and Turing Reducibility.
5. Write a short notes on universal Turing machine and Chomsky hierarchy.
6. Write a short notes on Context sensitive language and linear bounded automata.

Prepared by Chennuri Nagendra Sai (Asst.prof)

 For complete BTECH CSE, AIML, DS subjects tutorials visit : ns lectures youtube channel

7. Write a shot notes on post's correspondence problem and check the following is
PCP or not.

I A B
1 11 111
2 100 001
3 111 11
8. Define LR(0) items. Find LR(0) for the following example.
S’  Sc
S  SA / A
A  aSb/ab
9. Construct LR(0) for
SE
E  E*B E E + B
E  id

Prepared by Chennuri Nagendra Sai (Asst.prof)