Active automata learning as black-box search and lazy partition refinement

DOI10.1007/978-3-031-15629-8_17zbMath1524.68160OpenAlexW4297922692MaRDI QIDQ6108900

Falk Howar, Bernhard Steffen

Publication date: 26 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-15629-8_17

zbMATH Keywords

active automata learningmodel learningminimally adequate teacher

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Learning regular sets from queries and counterexamples
• Model learning as a satisfiability modulo theories problem
• On the learnability of infinitary regular sets
• Learning Mealy machines with one timer
• Inference of finite automata using homing sequences
• Learning Register Automata with Fresh Value Generation
• Inferring Canonical Register Automata
• Linear Automaton Transformations
• Learning Symbolic Automata
• Benchmarks for automata learning and conformance testing