Learning automata from ordered examples

zbMath0741.68086MaRDI QIDQ1186503

Sara Porat, Jerome A. Feldman

Publication date: 28 June 1992

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

zbMATH Keywords

finite-state automataconnectionist learning modelsfinite-state languages

Mathematics Subject Classification ID

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

Related Items

DKL: an efficient algorithm for learning deterministic Kripke structures, Learning regular languages from counterexamples, On the power of incremental learning., Variants of iterative learning