Deterministic finite automata with recursive calls and DPDAs

Open Webpage

Jean H. Gallier, Salvatore La Torre, Supratik Mukhopadhyay

Published: 2003, Last Modified: 01 Oct 2024Inf. Process. Lett. 2003EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: 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).