Scribd
Upload
601 views

Theory of Automata 20 Most Important Questions

tafl important

Uploaded by

shrey.bhaskar.it.2021
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
601 views

Theory of Automata 20 Most Important Questions

tafl important

Uploaded by

shrey.bhaskar.it.2021
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Meerut Institute of Engineering and Technology, Meerut

20 Important Question

KCS 402 Subject Name : Theory of Automata and Formal languages

Q. No. Question (Statement) - appeared in AKTU End Sem Exams

Q. No. Question(statement)- appeared in AKTU End Sem Exams


Convert the following Mealy machine into its equivalent Moore machine.

Convert the following NFA with ε moves to DFA without ε moves.

2
Construct a minimum state automaton equivalent to DFA whose transition table is defined by the transition table. q0 is the initial
state and q3 is the final state.

Minimize the given DFA-

5 Write Identities /properties of Regular Languages.


State Arden’s theorem and construct the regular expression for the following FA for regular expression (0+1)*(00+11)(0+1)* using
6 Arden’s
theorem.
Find regular expression for the following:
7
Language of all string that do not end with 01. Describe the language corresponding to following: (1+01)*(0+01)*
8 State the Pumping Lemma.Prove that following language L={a n b n } is not regular.
9 Define grammar? Explain Chomsky Hierarchy? Give an example

Explain about derivation and parse trees? Construct the string 0100110 from the Leftmost and Rightmost derivation. S0S/1AA
10
A0/1A/0B B1/0BB

Write the procedure and Eliminate left recursion from the following Grammar.
EE+T/T
11
TT*F/F
F(E)/id

Convert the following grammar into Greibach normal form.


12 SAA/a
ASS/b

Convert the following grammar into CNF.


13
SbA/aB AbAA/aS/a BaBB/bS/a.
14 Construct DPDA which accepts the language L = {wcwR | w {a, b}*, c Σ}
15 Construct PDA: Accepting the set of all strings over {a, b} with equal number of a’s and b’s. Show the moves for abbaba.

Convert to PDA, CFG with productions.


A o aAA, A -> aS | bS | a
S -> SS | (S) | H
16
S -> aAS | bAB | aB,
A -> bBB | aS | a,
B -> bA |

Convert PDA to CFG. PDA is given by P = ({p,q}, {0,1}, {X,Z}, δ, q, Z)), Transition function δ is defined by
δ(q, 1, Z) = {(q, XZ)}
δ(q, 1, X) = {(q, XX)}
17
δ(q, H, X) = {(q, H)}
δ(q, 0, X) = {(p, X)}
δ(p, 1, X) = {(p, H)}

18 Construct a Turing machine that recognizes the language L={anbn, n>1}. Show an ID for the string ‘aabb’ with tape symbols.
19 Construct a Turing machine that recognizes the language anbncn.
20 Explain Universal turing machine. Prove that Halting problem is undecidable.
21 Write the short notes on recursive languages and recursive enumerable languages.

You might also like