113 search results - page 2 / 23 » 2-Visibly Pushdown Automata |
CAV
2012
Springer
11 years 7 months ago
2012
Springer
Nested-word automata (NWAs) are a language formalism that helps bridge the gap between finite-state automata and pushdown automata. NWAs can express some context-free properties, ...
WIA
2001
Springer
13 years 9 months ago
2001
Springer
d Abstract) Zhe Dang , Tevfik Bultan ¡ , Oscar H. Ibarra ¡ , and Richard A. Kemmerer ¡ ¢ School of Electrical Engineering and Computer Science Washington State University P...
SIGCSE
2002
ACM
13 years 4 months ago
2002
ACM
This paper will present the Interactive Pushdown Automata Animation for use in an Automata Theory class. It will present the features of the IPAA as well as the algorithm and data...
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
FSEN
2009
Springer
13 years 12 months ago
2009
Springer
Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiv...