Approximate identification of automata
- 4 September 1975
- journal article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 11 (18) , 444-445
- https://doi.org/10.1049/el:19750342
Abstract
A technique is described for the identification of probabilistic and other nondeterministic automata from sequences of their input/output behaviour. For a given number of states the models obtained are optimal in well defined senses, one related to least-mean-square approximation and the other to Shannon entropy. Practical and theoretical investigations of the technique are outlined.Keywords
This publication has 1 reference indexed in Scilit:
- AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATONPublished by Elsevier ,1971