Scope-Bounded Pushdown Languages

DOI10.1142/S0129054116400074zbMath1344.68124MaRDI QIDQ5890814

Gennaro Parlato, Salvatore La Torre, Margherita Napoli

Publication date: 23 June 2016

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

visibly pushdown automatamultistack pushdown automatamodels of concurrent systemslanguage theory and automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Revisiting Underapproximate Reachability for Multipushdown Systems ⋮ Sweeping input-driven pushdown automata ⋮ Reachability of scope-bounded multistack pushdown systems ⋮ Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete ⋮ Visibly pushdown modular games ⋮ On the path-width of integer linear programming ⋮ Input-driven multi-counter automata ⋮ Digging input-driven pushdown automata

Cites Work

• Budget-bounded model-checking pushdown systems
• Reducing concurrent analysis under a context bound to sequential analysis
• ADJACENT ORDERED MULTI-PUSHDOWN SYSTEMS
• On Context-Free Languages
• MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS

This page was built for publication: Scope-Bounded Pushdown Languages