113 search results - page 8 / 23 » 2-Visibly Pushdown Automata |
STACS
2005
Springer
14 years 28 days ago
2005
Springer
CAV
2001
Springer
13 years 12 months ago
2001
Springer
ACL
1989
13 years 8 months ago
1989
A novel formalism is presented for Earley-like parsers. It accommodates the simulation of non-deterministic pushdown automata. In particular, the theory is applied to non-determin...
LATA
2010
Springer
14 years 4 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...