Deterministic finite automata with recursive calls and DPDAs

https://doi.org/10.1016/S0020-0190(03)00281-3Get rights and content

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).

References (18)

There are more references available in the full text version of this article.

This research was partially supported by the supported by the MIUR in the framework of the project “Metodi Formali per la Sicurezza” (MEFISTO) and MIUR grant 60% 2002.

View full text