Unambiguity in Timed Regular Languages: Automata and Logics

DOI10.1007/978-3-642-15297-9_14zbMath1290.68079OpenAlexW115677451MaRDI QIDQ3588092

Paritosh K. Pandya, Simoni S. Shah

Publication date: 10 September 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-15297-9_14

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Temporal logic (03B44)

Related Items (1)

On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing

This page was built for publication: Unambiguity in Timed Regular Languages: Automata and Logics