Assignment

KCS-402 Theory of Automata

Cs 2nd Year(A1,A2,A3) Weak Student

Prepared By: Ashish Kumar Singh

NOTE: Prepare these questions in 3 days of receipt of this assignment, there will be a test
containing questions from this assignment. If you fail to appear in this test, strict action will
be taken.

1) Design FA for a binary number divisible by 5.

2) Construct a minimum state DFA from given FA

3) Find the regular expression corresponding to the finite automata given bellow:

4) Convert the following CFG to its equivalent GNF:

S → AA | a, A → SS | b.

5) Prove that the following Language L = {anbn} is not regular

6) Design the CFG for the following language:

7) Write regular expression for set of all strings such that number of a’s divisible

by 3 over Σ = {a,b}

8) Design FA for the following languages containing binary strings:

(i) Having both 00 and 11 as substring.

(ii) Number of 0’s is odd and number of 1’s is multiple of 3.

9) 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

10) Design an NFA for the language containing strings ending with ab or ba. Also

convert the obtained NFA into equivalent DFA.

11) State Arden’s theorem and construct regular expression for the following FA

Using Arden’s theorem:

12) Design a PDA for accepting a language {0 n1m0n | m, n>=1}.

13) Design a PDA for accepting a language {a nb2n | n>=1}.

14) Construct a PDA that accepts { wcwR | w is any string of a's and b's } by empty stack

15) Construct a PDA for language L = {0 n1m | n >= 1, m >= 1, m > n+2}
16) Design a FA for strings not containing two consecutive zero or two consecutive one

17) Using pumping lemma for Regular languages prove that language

18) Construct a TM for the language L = {0n1n2n} where n≥1

19) Construct a TM machine for checking the palindrome of the string of even length.

20) Design a Turing machine to recognize all strings consisting of an even number of 1's.