Learning automata from ordered examples

MaRDI QIDQ1186503zbMATH OpenFDO

Authors Sara Porat, Jerome A. Feldman

Publication date 28 June 1992

Published in Machine Learning (Search for Journal in Brave)

zbMATH Keywords

connectionist learning modelsfinite-state automatafinite-state languages

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 53316
• Efficient learning of typical finite automata from random walks
• scientific article; zbMATH DE number 1008506

Cited in

(8)

• Learning regular languages from counterexamples
• Applying learning by examples for digital design automation
• On the power of incremental learning.
• Variants of iterative learning
• Learning Moore machines from input-output traces
• scientific article; zbMATH DE number 53316 (Why is no real title available?)
• scientific article; zbMATH DE number 2019593 (Why is no real title available?)
• DKL: an efficient algorithm for learning deterministic Kripke structures

This page was built for publication: Learning automata from ordered examples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186503)