Professional Documents
Culture Documents
(C2) (3+3+3= 9)
Q.NO.3. convert the given DFA into Regular Expression using Kleene’s Theorem part 2
(C2) (4)
II) Draw Mealy Machine which take binary number from user and count how many times substrings
1101 . (C2) (3)
Q.NO.4. (C3) (15)
a. i) Design CFG of the language that start and end with the double letters (aa 0r bb), then convert that CFG in
its equivalent FA.
1
ii) Build an FA that accepts only those words in which letter a occurs in multiple of 4 and also convert that FA
to CFG.
b. Convert The Following CFG( context Free Language) into CNF (Chomsky Normal Form)
S ASA|BSB|aB|D
A B|S
D a
B b|