A Logical Characterization of Timed (non-)Regular Languages
From MaRDI portal
Publication:2922004
DOI10.1007/978-3-662-44522-8_7zbMath1426.03017OpenAlexW41344992MaRDI QIDQ2922004
Pierluigi San Pietro, Matteo Rossi, Marcello M. Bersani
Publication date: 14 October 2014
Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11311/929555
Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Related Items
On the initialization of clocks in timed formalisms, A logical characterization of timed regular languages, A tool for deciding the satisfiability of continuous-time metric temporal logic