Efficient algorithms for the inference of minimum size DFAs

DOI10.1023/A:1010828029885zbMath0983.68105WikidataQ58884065 ScholiaQ58884065MaRDI QIDQ5945683

Arlindo L. Oliveira, João P. M. Silva

Publication date: 21 April 2002

Published in: Machine Learning (Search for Journal in Brave)

zbMATH Keywords

minimum size deterministic automata

Mathematics Subject Classification ID

Searching and sorting (68P10) Formal languages and automata (68Q45)

Related Items (8)

LARS: a learning algorithm for rewriting systems ⋮ Inferring regular languages and \(\omega\)-languages ⋮ Learning Meets Verification ⋮ Regular inference as vertex coloring ⋮ A multi-parameter analysis of hard problems on deterministic finite automata ⋮ Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT ⋮ Inference of regular languages using state merging algorithms with search ⋮ FSM inference from long traces

This page was built for publication: Efficient algorithms for the inference of minimum size DFAs