Polynomial Distinguishability of Timed Automata

DOI10.1007/978-3-540-88009-7_19zbMath1177.68128OpenAlexW1502355723MaRDI QIDQ3528423

Cees Witteveen, Sicco Verwer, Mathijs de Weerdt

Publication date: 16 October 2008

Published in: Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88009-7_19

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (3)

Efficiently identifying deterministic real-time automata from labeled data ⋮ Active learning of timed automata with unobservable resets ⋮ One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit

This page was built for publication: Polynomial Distinguishability of Timed Automata