Question: 1)Construct a PDA accepting the language {a n b 2n | n 0}. Prove your construction correct. 2) Which of the following languages are regular?
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}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
