MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
From MaRDI portal
Publication:5687660
DOI10.1142/S0129054196000191zbMath0859.68053MaRDI QIDQ5687660
Stefano Crespi Reghizzi, Luca Breveglieri, Claudio Citrini, A. Cherubini Spoletini
Publication date: 22 January 1997
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items (39)
Some decision problems concerning semilinearity and commutation. ⋮ Realizability of concurrent recursive programs ⋮ PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS ⋮ Ordered multi-stack visibly pushdown automata ⋮ The complexity of model checking multi-stack systems ⋮ Recursion Schemes and the WMSO+U Logic ⋮ On store languages and applications ⋮ Cost Automata, Safe Schemes, and Downward Closures ⋮ Unnamed Item ⋮ On counting functions and slenderness of languages ⋮ Pushdown timed automata: A binary reachability characterization and safety verification. ⋮ Analyzing pushdown systems with stack manipulation ⋮ Emptiness of Multi-pushdown Automata Is 2ETIME-Complete ⋮ Reachability of scope-bounded multistack pushdown systems ⋮ Unnamed Item ⋮ Temporal logics for concurrent recursive programs: satisfiability and model checking ⋮ Budget-bounded model-checking pushdown systems ⋮ Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete ⋮ Bounded Context Switching for Valence Systems ⋮ Beyond \(\omega \)-regular languages: \(\omega T\)-regular expressions and their automata and logic counterparts ⋮ Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity ⋮ Storage products and linear control of derivations ⋮ JUMPING FINITE AUTOMATA ⋮ Global index grammars and descriptive power ⋮ Unnamed Item ⋮ Scope-Bounded Pushdown Languages ⋮ Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata ⋮ Input-driven multi-counter automata ⋮ Unnamed Item ⋮ On exteriority notions in book embeddings and treewidth ⋮ Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata ⋮ On Families of Full Trios Containing Counter Machine Languages ⋮ On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L ⋮ Data Multi-Pushdown Automata ⋮ ADJACENT ORDERED MULTI-PUSHDOWN SYSTEMS ⋮ On families of full trios containing counter machine languages ⋮ Semilinearity of Families of Languages ⋮ Augmenting the discrete timed automaton with other data structures. ⋮ The Complexity of the Diagonal Problem for Recursion Schemes
This page was built for publication: MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
