Unambiguity in Timed Regular Languages: Automata and Logics

DOI10.1007/978-3-642-15297-9_14MaRDI QIDQ3588092zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A logical characterization of timed (non-)regular languages
• A logical characterization of timed regular languages
• The containment problem for unambiguous register automata and unambiguous timed automata
• Unambiguity in automata theory
• scientific article; zbMATH DE number 4020497
• Classes of timed automata and the undecidability of universality
• Classes of timed automata and the undecidability of universality
• scientific article; zbMATH DE number 1256652
• A uniform framework for timed automata
• scientific article; zbMATH DE number 1956642

Cited in

(5)

• Untimed Language Preservation in Timed Systems
• On expressive powers of timed logics: comparing boundedness, non-punctuality, and deterministic freezing
• On Unary Fragments of MTL and TPTL over Timed Words
• Deterministic logics for UL
• scientific article; zbMATH DE number 1956642 (Why is no real title available?)

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

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