A Machine-Independent Characterization of Timed Languages

DOI10.1007/978-3-642-31585-5_12zbMath1367.68159OpenAlexW2157757085MaRDI QIDQ3167002

Mikołaj Bojańczyk, Sławomir Lasota

Publication date: 1 November 2012

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31585-5_12

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Nonclassical and second-order set theories (03E70)

Related Items (5)

Relating timed and register automata ⋮ Reachability relations of timed pushdown automata ⋮ Unnamed Item ⋮ Fast computations on ordered nominal sets ⋮ Unnamed Item

This page was built for publication: A Machine-Independent Characterization of Timed Languages