A logical characterization of timed pushdown languages

DOI10.1007/978-3-319-20297-6_13MaRDI QIDQ3194716zbMATH OpenOpenAlexFDO

Authors 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

matchingsrelative distance logictimed languagestimed pushdown automatavisibly pushdown languages

Mathematics Subject Classification ID

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

Recommendations

• Logics for weighted timed pushdown automata
• Dense-timed pushdown automata
• A logical characterization for dense-time visibly pushdown automata
• Timed Pushdown Automata Revisited
• Reachability relations of timed pushdown automata

Cites work

• A Nivat theorem for weighted timed automata and weighted relative distance logic
• A theory of timed automata
• Computing optimal reachability costs in priced dense-timed pushdown automata
• Decision Problems of Finite Automata Design and Related Arithmetics
• Dense-timed pushdown automata
• Generalized finite automata theory with an application to a decision problem of second-order logic
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• Hybrid Systems: Computation and Control
• MSO logics for weighted timed automata
• Pushdown timed automata: A binary reachability characterization and safety verification.
• Transductions des langages de Chomsky
• Visibly pushdown languages
• Weak Second‐Order Arithmetic and Finite Automata
• Weighted automata and weighted logics
• Weighted Logics for Nested Words and Algebraic Formal Power Series

Cited in

(15)

• LOGSPACE and PTIME characterized by programming languages
• Logspace and logtime leaf languages
• Logic for \(\omega\)-pushdown automata
• Context-free timed formalisms: robust automata and linear temporal logics
• Reachability relations of timed pushdown automata
• Greibach normal form for \(\omega\)-algebraic systems and weighted simple \(\omega\)-pushdown automata
• A logical characterization for dense-time visibly pushdown automata
• A perfect class of context-sensitive timed languages
• Logics for weighted timed pushdown automata
• Dense-timed pushdown automata
• A Machine-Independent Characterization of Timed Languages
• Timed context-free temporal logics
• scientific article; zbMATH DE number 1502114 (Why is no real title available?)
• scientific article; zbMATH DE number 1863168 (Why is no real title available?)
• Well-structured pushdown system: case of dense timed pushdown automata

This page was built for publication: A logical characterization of timed pushdown languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3194716)