Deterministic finite automata with recursive calls and DPDAs

JH Gallier, S La Torre, S Mukhopadhyay - Information processing letters, 2003 - Elsevier
We study deterministic finite automata (DFA) with recursive calls, that is, finite sequences of
component DFAs that can call each other recursively. DFAs with recursive calls are akin to
recursive state machines and unrestricted hierarchic state machines. We show that they are
language equivalent to deterministic pushdown automata (DPDA).
Showing the best result for this search. See all results