Context free langage


#1

show that every regular set accepted by fininte automaton with n states is accepted to final state by deterministic pda with n states and one pushdown symbol. Deduce that every regular set is a deterministic context-free language.