in Theory of Computation edited by
1,822 views
4 votes
4 votes
Construct npda for the following languages on $∑ =$ {$a,b,c$}

  $L =$ { $w : n_a(w) = 2*n_b(w)$ }
in Theory of Computation edited by
1.8k views

1 Answer

0 votes
0 votes

1) L={a^2n b^n }

edited by

2 Comments

This would not work as the examples taken assume that 'b's occur after 'a's.
1
1
why you have considered a^2nb^n?
0
0

Related questions