Learning Mealy machines with one timer

DOI10.1016/J.IC.2023.105013MaRDI QIDQ6186313zbMATH OpenFDO

Authors F. Vaandrager, Masoud Ebrahimi, Roderick Bloem

Publication date 2 February 2024

Published in Information and Computation (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/J.IC.2023.105013

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A theory of timed automata
• Active learning of timed automata with unobservable resets
• Combining black-box and white-box techniques for learning register automata
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• Learning Mealy machines with one timer
• Learning of event-recording automata
• Learning regular sets from queries and counterexamples
• Time to learn -- learning timed automata from tests

Cited in

(1)

• A Myhill-Nerode style characterization for timed automata with integer resets

This page was built for publication: Learning Mealy machines with one timer

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