280 views

1 Answer

Best answer
2 votes
2 votes

The language accepted by PDA is 

L = { $a^{m} b^{n} c^{m + n} $ | m, n >= 0 }

ex:  $aaabbccccc$  is accepted by PDA. Whenever $a$ and $b$ comes it pushes into the stack and whenever $c$ comes it pops until the stack is empty.

$\epsilon$  is also accepted.

selected by

Related questions

0 votes
0 votes
0 answers
1
raj_uddeshya157 asked Dec 27, 2023
67 views
Can $\Sigma^{*}$ be called DCFL? If yes, what would the state transition diagram of its PDA look like?
1 votes
1 votes
1 answer
2