Identification of automata by sequential learning

Authors:
M Richetin;M Naranjo;P Luneau
Affiliations:
Electronics Laboratory, University of Clermont 11, BP 45, 63170 Aubière, France;Electronics Laboratory, University of Clermont 11, BP 45, 63170 Aubière, France;Electronics Laboratory, University of Clermont 11, BP 45, 63170 Aubière, France
Venue:
Pattern Recognition Letters
Year:
1984

Citing 2
Cited 0

The theory of parsing, translation, and compiling

The theory of parsing, translation, and compiling
Testing Software Design Modeled by Finite-State Machines

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.10

Visualization

Abstract

Identification of automata from input/output sequences can be useful for the understanding of their functioning when differences appear between a theoretical behaviour and a real one. Two new inference algorithms are presented which are based on a sequential learning scheme: The different states are discovered through an induction-contradiction-discrimination procedure.