Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata

DOI10.1007/978-3-319-04921-2_5zbMath1407.68245OpenAlexW1568608011MaRDI QIDQ5404901

Jari Stenman, Mohamed Faouzi Atig, Parosh Aziz Abdulla

Publication date: 31 March 2014

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04921-2_5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

A Logical Characterization of Timed Pushdown Languages ⋮ Logics for Weighted Timed Pushdown Automata

This page was built for publication: Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata