2-Visibly Pushdown Automata
From MaRDI portal
Publication:5428226
DOI10.1007/978-3-540-73208-2_15zbMath1202.68222OpenAlexW1884709457MaRDI QIDQ5428226
Aniello Murano, Dario Carotenuto, Adriano Peron
Publication date: 28 November 2007
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73208-2_15
Related Items
Model-Checking HyperLTL for Pushdown Systems ⋮ Descriptional Complexity of Input-Driven Pushdown Automata ⋮ Ordered multi-stack visibly pushdown automata ⋮ Reachability of scope-bounded multistack pushdown systems ⋮ Model checking properties on reduced trace systems ⋮ Reachability Analysis of Pushdown Systems with an Upper Stack ⋮ Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata ⋮ Deciding path size of nondeterministic (and input-driven) pushdown automata ⋮ Context-free timed formalisms: robust automata and linear temporal logics