Reference no: EM132533083
Assignment-1
Question 1. Construct a DFA equivalent to the NFA. M=({p,q,r},{0,1}, δp,{q, s}) Where δ is defined in the following table.
|
0
|
1
|
P
|
{q, s}
|
{q}
|
q
|
{r}
|
{q, r}
|
r
|
{s}
|
{p}
|
s
|
-
|
{p}
|
Question 2 Show that the set L = (anbn/n>=1} is not a regular.
Question 3 Construct a derivation tree for the string 0011000 using the grammar S→ A0S| 0 |SS|, A → S1A|10.
Question 4 Discuss in detail about ambiguous grammar and removing ambiguity from grammar.
Question 5. Simplify the following grammar S→ aAa | bBb | BB. A →C, B→ S , A, C →S I ∈
Question 6. What is additional feature PDA has when compared with NFA? Is FDA superior over NFA in the sense of language acceptance? Justify your answer.
Question 7 Is it true that deterministic push down automata and non-deterministic posh down automata are equivalent in the sense of language of acceptances? Justify your answer.
Question 8 Construe a PDA accepting (an bm an /m, n> 1 n)al I by empty slack. Also construct the corresponding context-free grammar accepting the same set
Question 9. Construct a CFG representing the set of palindromes over (0+1)*.
Question 10 Let G be the grammar S→ aB|bA, A→ a|aS|bAA, B→ b|bS|aBB. Obtain parse tree for the string aaabbabblaa.
Question 11. Construct a context free Grammar for the given expression (a+b).(a+b+0+1)*.