A Logical Characterization of Timed Pushdown Languages

DOI10.1007/978-3-319-20297-6_13zbMath1466.68050OpenAlexW1040856184MaRDI QIDQ3194716

Vitaly Perevoshchikov, Manfred Droste

Publication date: 20 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-20297-6_13

zbMATH Keywords

matchingstimed languagesvisibly pushdown languagestimed pushdown automatarelative distance logic

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (4)

Greibach normal form for \(\omega\)-algebraic systems and weighted simple \(\omega\)-pushdown automata ⋮ Logics for Weighted Timed Pushdown Automata ⋮ Reachability relations of timed pushdown automata ⋮ Logic for \(\omega\)-pushdown automata

Cites Work

• Unnamed Item
• MSO logics for weighted timed automata
• Transductions des langages de Chomsky
• A theory of timed automata
• Pushdown timed automata: A binary reachability characterization and safety verification.
• Weighted automata and weighted logics
• Dense-Timed Pushdown Automata
• Weak Second‐Order Arithmetic and Finite Automata
• Weighted Logics for Nested Words and Algebraic Formal Power Series
• Visibly pushdown languages
• Decision Problems of Finite Automata Design and Related Arithmetics
• A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic
• Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Hybrid Systems: Computation and Control

This page was built for publication: A Logical Characterization of Timed Pushdown Languages