Scribd
Upload
58 views2 pages

Tafl Question

Uploaded by

ISHAN SRIVASTAVA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
58 views2 pages

Tafl Question

Uploaded by

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

https://www.youtube.

com/c/AKTUImportantquestions

AKTU B.TECH
THEORY OF AUTOMATA & FORMAL LANGUAGE

Important questions

1. Define NFA. What are various points of difference between NFA and DFA?
2. What are various points of difference between Moore & Mealy Machine? Explain the
procedure to convert a moore machine into Mealy machine.

3. Find the regular expression of Given FA using Arden’s theorem

4. Convert the following grammar in GNF:


S A → B , A → BS / a , B → SA / b

5. Design PDA for Language


R WcW W a ∈ ( , b) *

6. Define ambiguity. Show that the grammar G with following production is ambiguous.
S → a | aAb | abSb, A → aAAb | bS

7. Define PCP. Let A = {1, 110, 0111} and B = {111, 001, 11} and  = {0, 1}.
Find the solution of PCP.

8. Find a PCP solution for the following sets


A = {ab, ba, b, abb, a}, B= {aba, abb, ab, b, bab}

9. Explain various types of Turing Machines with example.


10. Define Greibach normal form for a CFG. Reduce the following CFG into GNF:
S A → → B, | A BS a, B → SA| b

11. Describe Chomsky hierarchy of languages with proper example.

12. Design a Turing machine that accepts Palindromes of binary numbers


13. Write the procedure to convert a given CFG into equivalent grammar in CNF. Apply
the procedure and convert the grammar with following production into CNF:
S→bA|aB, A→bAA|aS|a, B→aBB|bS|b

14. Convert the following PDA into its equivalent CFG


Transition function is defined as:
0 0 0 0 δ ( , q Z 0, ) ={( , q 0Z )} 0 0 δ (q q ,0,0) = {( ,00)} 0 1 δ (q q ,1,0) = ∈ {( , )} 1 1 δ (q q ,1,0) = ∈
{( , )} 1 0 2 δ (q Z ,∈ = , ) {(q ,∈ )}

15. Design the CFG for the following language:


L = {0m1 n | m ≠ n & m,n ≥ 1} ii) L = {al b mc n | l + m = n & l,m ≥ 1}

16. Write short note on:


i) Recursive Language and Recursively Enumerable Language.
ii) PCP problem and Modified PCP Problem

17. Design a TM for the following language:


L = { an b n c n | n≥ 1}

18. Construct a minimum state DFA from given FA

19. Find the regular expression corresponding to the finite automata given bellow:

20. Using pumping lemma for Regular languages prove that language { } 2 | 1 i L = ≥ is not
regular.

You might also like