1. Engineering
  2. Computer Science
  3. 1construct a pda accepting the language an b2n n...

Question: 1construct a pda accepting the language an b2n n...

Question details

1)Construct a PDA accepting the language {an b2n | n ≥ 0}.

Prove your construction correct.

2) Which of the following languages are regular? Give short explanations. (The alphabet is   Σ = {a, b}.)

a) L = {w:na(w) ≠ nb(w)}

b) L ={ anb1 : n >= 100, l <= 100}

c) L ={uwwrv :u,v,w ∈ Σ +}

d) L ={bnalbk : n>5, l>3, l >= k}

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution