Passive automata learning: DFAs and NFAs

DOI10.1007/978-3-031-15629-8_31zbMath1524.68162OpenAlexW4297922611MaRDI QIDQ6163903

Hans Zantema

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_31

Mathematics Subject Classification ID

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

Cites Work

• Learning regular sets from queries and counterexamples
• Model learning as a satisfiability modulo theories problem
• Exact DFA Identification Using SAT Solvers
• Complexity of automaton identification from given data

This page was built for publication: Passive automata learning: DFAs and NFAs