337 views
0 votes
0 votes

Construct npda's that accept the following languages on $Σ =$ {$a, b, c$}.
(a) $L =$ {$a^nb^{2n} : n ≥ 0$}.
(b) $L =$ {$wcw^R : w ∈$ {$a, b$}$^*$}.
(c) $L =$ {$a^nb^mc^{n+m} : n ≥ 0, m ≥ 0$}.
(d) $L =$ {$a^nb^{n+m}c^m : n ≥ 0, m ≥ 1$}.
(e) $L =$ {$a^3b^nc^n : n ≥ 0$}.
(f) here
(g) $L =$ {$w : n_a (w) = n_b (w) + 1$}.
(h) here
(i) $L =$ {$w : n_a (w) + n_b (w) = n_c (w)$}.
(j) here.
(k) $L =$ {$w : n_a (w) < n_b (w)$}.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
3
0 votes
0 votes
0 answers
4