Polynomial Distinguishability of Timed Automata
From MaRDI portal
Publication:3528423
DOI10.1007/978-3-540-88009-7_19zbMath1177.68128MaRDI 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
68Q32: Computational learning theory
68Q45: Formal languages and automata
68Q42: Grammars and rewriting systems
Related Items
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