Combining black-box and white-box techniques for learning register automata
From MaRDI portal
Publication:2075785
DOI10.1007/978-3-319-91908-9_26zbMath1482.68113OpenAlexW2977245035MaRDI QIDQ2075785
Bengt Jonsson, Falk Howar, Frits W. Vaandrager
Publication date: 16 February 2022
Full work available at URL: https://doi.org/10.1007/978-3-319-91908-9_26
Computational learning theory (68Q32) Formal languages and automata (68Q45) History of computer science (68-03)
Related Items (9)
Learning One-Clock Timed Automata ⋮ Model checking, synthesis, and learning ⋮ Enhancing active model learning with equivalence checking using simulation relations ⋮ Learning deterministic one-clock timed automata via mutation testing ⋮ Unnamed Item ⋮ Learning Mealy machines with one timer ⋮ Unnamed Item ⋮ Learning Mealy machines with one timer ⋮ A Myhill-Nerode theorem for register automata and symbolic trace languages
This page was built for publication: Combining black-box and white-box techniques for learning register automata
