113 search results - page 3 / 23 » 2-Visibly Pushdown Automata |
MFCS
2007
Springer
14 years 2 days ago
2007
Springer
The minimization problem for visibly pushdown automata (VPA) is studied. Two subclasses of VPA are introduced: call driven automata, and block automata. For the first class, minim...
MFCS
2007
Springer
14 years 2 days ago
2007
Springer
Abstract. We define the notion of height-deterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on t...
SOFSEM
2012
Springer
12 years 1 months ago
2012
Springer
Visibly Pushdown Transducers (VPT) form a subclass of pushdown transducers. In this paper, we investigate the extension of VPT with visibly pushdown look-ahead (VPTla). Their trans...
RP
2009
Springer
14 years 15 days ago
2009
Springer
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
LATA
2009
Springer
14 years 22 days ago
2009
Springer
We show that fixed membership testing for many interesting subclasses of multi-pushdown machines is no harder than for pushdowns with single stack. The models we consider are MVPA...