Identification of automata by sequential learning

DOI10.1016/0167-8655(84)90004-7MaRDI QIDQ3219768zbMATH OpenOpenAlexFDO

Authors M. Richetin, M. Naranjo, P. Luneau

Publication date 1984

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8655(84)90004-7

zbMATH Keywords

Identification of automata from input/output sequencesinference algorithms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Inference of finite automata using homing sequences
• scientific article; zbMATH DE number 1008506
• Transitions identification experiments with information-lossless automata
• Learning Regular Languages Using Nondeterministic Finite Automata
• Efficient learning of typical finite automata from random walks

Cited in

(13)

• Applying learning by examples for digital design automation
• A comparative analysis of recent identification approaches for discrete-event systems
• Learning Moore machines from input-output traces
• Inference of finite automata using homing sequences
• CGE: a sequential learning algorithm for Mealy automata
• scientific article; zbMATH DE number 5638055 (Why is no real title available?)
• Identification of finite automata based on distribution of output m- tuples. II.
• Diversity-based inference of finite automata
• scientific article; zbMATH DE number 1784869 (Why is no real title available?)
• NEW METHODS FOR THE IDENTIFICATION OF FINITE STATE SYSTEMS
• Transitions identification experiments with information-lossless automata
• Input-output identification of controlled discrete manufacturing systems
• State identification, existence of sequences and machine classification

This page was built for publication: Identification of automata by sequential learning

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