113 search results - page 7 / 23 » Height-Deterministic Pushdown Automata |
146
click to vote
LATA
2009
Springer
16 years 18 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...
181
click to vote
LICS
2007
IEEE
16 years 3 days ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
177
click to vote
DNA
2004
Springer
15 years 11 months ago
2004
Springer
We propose a new way to implement (general) computing devices with unbounded memory. In particular, we show a procedure to implement automata with unbounded stack memory, push-down...
125
click to vote
FSTTCS
2006
Springer
15 years 9 months ago
2006
Springer
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...
144
click to vote
CAV
2006
Springer
15 years 9 months ago
2006
Springer
We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...