Deterministic finite automata with recursive calls and DPDAs

Authors:
Jean H. Gallier;Salvatore La Torre;Supratik Mukhopadhyay
Affiliations:
University of Pennsylvania, Philadelphia, PA;Università degli Studi di Salerno, Dipartimento di Informatica ed Applicazioni, Via S. Allende, Baronissi (SA) 84081, Italy;West Virginia University, Morgantown, WV
Venue:
Information Processing Letters
Year:
2003

Citing 7
Cited 0

Statecharts: A visual formalism for complex systems

Science of Computer Programming
Model checking of hierarchical state machines

SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
The Unified Modeling Language user guide

The Unified Modeling Language user guide
Transition network grammars for natural language analysis

Communications of the ACM
Decidability of DPDA equivalence

Theoretical Computer Science
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
The Equivalence Problem for Deterministic Pushdown Automata is Decidable

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	0.89

Visualization

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