FLAT MID -I

QUESTION BANK
1. Design DFA to accept binary strings divisible by 7.

2. Design NFA accepting strings end with 101 and convert to DFA
3. Explain the use of epsilon moves. Show the equivalence of NFA with epsilon moves to
NFA without epsilon moves.
4.Explain the minimization of DFA with an example

5. Design a mealy machine displays the reminder of the binary string when
divisible by 3
6. Design DFA accepting strings contain number of zero’s are multiples of 3 and number of
one’s are multiples of five

7. Design NFA accepting strings contain substring 101 and convert to DFA

8. Explain the use of epsilon moves. Show the equivalence of NFA and DFA with an
example

9.Explain the minimization of DFA with an example

10. Design a Moore machine displays the reminder of the binary string when divisible by 5

11. Design mealy machine to covert the given binary number to its two’s complement form

12. Explain identity rules of regular expressions and show the equivalence of regular
expressions with an example

13. Design finite automata accepting strings start with 0 and end with 11. Convert the
previous DFA to regular expression using ardens theorem.

14. Design finite automata accepting strings start with 1 and end with 00. Convert the
previous DFA to regular expression using ardens theorem.
15. Find out the R.E. for given F.A .
16. Explain closure properties of Regular languages

17. Construct CNF for the given grammar.

SaaaaS
Saaaa.
18. Show that regular languages are subset of context free languages with an
example
19. Show with an example ambiguous grammar and explain its disadvantages
20. With an example explain the conversion of LLG to FA