Learning Deterministic Finite Automata from Smallest Counterexamples

DOI10.1137/S0895480198340943zbMath0968.68071OpenAlexW2007029921WikidataQ124831628 ScholiaQ124831628MaRDI QIDQ2706180

Andreas Birkendorf, Andreas Böker, Hans Ulrich Simon

Publication date: 19 March 2001

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480198340943

zbMATH Keywords

deterministic finite automatamultiplicity automataself-directed learninglearning from smallest counterexamples

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (2)

A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages ⋮ Automatic symbolic compositional verification by learning assumptions

This page was built for publication: Learning Deterministic Finite Automata from Smallest Counterexamples