Deterministic finite automata with recursive calls and DPDAs☆
References (18)
Dpda's in “atomic normal form” and applications to equivalence problems
Theoret. Comput. Sci.
(1981)Statecharts: a visual formalism for complex systems
Sci. Comput. Programm.
(1987)- et al.
Strict deterministic grammars
J. Comput. System Sci.
(1973) Decidability of DPDA equivalence
Theoret. Comput. Sci.
(2001)- et al.
Model checking of hierarchical state machines
- et al.
Analysis of recursive state machines
- et al.
Model checking of unrestricted hierarchical state machines
- et al.
Unified Modeling Language User Guide
(1997) On the transition graphs of Turing machines
There are more references available in the full text version of this article.
Cited by (2)
Enhancing active model learning with equivalence checking using simulation relations
2022, Formal Methods in System Design
- ☆
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.
Copyright © 2003 Elsevier B.V. All rights reserved.