371 search results - page 1 / 75 » Pushdown Automata Simulator |
ACL
1989
14 years 12 hour 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...
CSL
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
EDUTAINMENT
2009
Springer
14 years 5 months ago
2009
Springer
DLT
2008
14 years 9 days ago
2008
We consider multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-emp...
FSTTCS
2004
Springer
14 years 4 months ago
2004
Springer
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...