A Perfect Class of Context-Sensitive Timed Languages

DOI10.1007/978-3-662-53132-7_4zbMath1436.68161OpenAlexW2488681735MaRDI QIDQ2817374

Shankara Narayanan Krishna, Vrunda Dave, Ashutosh Trivedi, Ramchandra Phawade, Devendra Bhave

Publication date: 30 August 2016

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53132-7_4

zbMATH Keywords

context-sensitive languagestimed languagesmultistack automataperfect languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Revisiting Underapproximate Reachability for Multipushdown Systems ⋮ Reachability relations of timed pushdown automata

Cites Work

• Unnamed Item
• Event-clock automata: a determinizable class of timed automata
• A theory of timed automata
• A Logical Characterization for Dense-Time Visibly Pushdown Automata
• Model-Checking of Ordered Multi-Pushdown Automata
• A Unifying Approach for Multistack Pushdown Automata
• Dense-Timed Pushdown Automata
• A Perfect Model for Bounded Verification
• The Language Theory of Bounded Context-Switching
• Visibly pushdown languages
• Event-Clock Visibly Pushdown Automata
• Recursive Timed Automata
• Reachability Problem for Weak Multi-Pushdown Automata
• Scope-Bounded Pushdown Languages

This page was built for publication: A Perfect Class of Context-Sensitive Timed Languages