Digital Assignment

CSI1003 Formal Languages and Automata Theory

1) Construct a DFT for the following languages over the alphabet {0,1}
(a) w begins with a 1 and ends with a 0
(b) w contains at least three 1’s
(c) w does not contain substring 011
(d) w the number of 0’s is divisible by 5 and the number of 1’s divisible by
3.

2) Write the formal definitions of NFA and DFA.

3) Design a DFA for the following language on ={a,b} L={w: na(w) mod 3 >1}
4) Describe the language generated by the following regular expression
 (0/1)* 000 (1/0)*
 (0/1)(0/1)(0/1)00(0/1)*
5) Find the language generated by the following grammar

SaB

Bb | bA

AaB

6) Construct a Minimized DFA for the given regular expression over alphabet is {a,b}
()*ab
7) Convert the given FA to RE
8) Convert the NFA to DFA

9) Convert the given FA into RG

10) Consider the regular expression (a + b)*a. Construct a regular grammar for this
regular expression.
11) Prove the following languages are not regular :

i.

ii.
12) Prove that following grammars are ambiguous grammar

i.

ii.
13) Simplification of CFG
i.

ii.

14) Convert the given CFG to CNF

15) Convert the given CFG to GNF

16) Check whether the string w=aabbb is accept by the given CFG or not using CYK
algorithm

17) Construct the PDA for the language L={anbn+mcm | n,m >0}
18) Construct the PDA for the language L={wcwR | w belong to {a,b}*}
19) Construct the PDA for the language fully balanced parenthesis (), {}, []
20) Construct the PDA for the language L={ w: no of a's in w is equal to the two
times of no of b's in w | w belong to {a,b}*} or
{w belong to {a,b}* | na(w) =2 nb(w)}
21) Construct the PDA for the language L={w belong to {a,b}* | na(w) < nb(w)}
22) Construct the TM for the language L={w belong to {a,b}* | na(w) =nb(w)}
23) Difference between Recursive languages and Recursively enumerable languages
24) Define Computable functions? Give one example for computable function and
prove the same.
25) Define Language acceptance by FA, PDA and TM