in Theory of Computation
172 views
0 votes
0 votes
Show that every regular language is a deterministic context-free language.
in Theory of Computation
172 views

1 Answer

0 votes
0 votes
Since every regular language can have a deterministic FA, a DPDA can be designed similar to the DFA, such that nothing is pushed on stack for each symbol of input..

Related questions