Learning Automata Teams

DOI10.1007/978-3-642-15488-1_6zbMath1291.68191OpenAlexW1771614261WikidataQ58209339 ScholiaQ58209339MaRDI QIDQ3588364

No author found.

Publication date: 10 September 2010

Published in: Grammatical Inference: Theoretical Results and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15488-1_6

zbMATH Keywords

DFA learningautomata teams

Mathematics Subject Classification ID

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

Related Items (3)

Polynomial characteristic sets for \(DFA\) identification ⋮ Regular inference as vertex coloring ⋮ A sufficient condition to polynomially compute a minimum separating DFA

This page was built for publication: Learning Automata Teams