Inference of a probabilistic finite state machine from its output
- 1 March 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. 25 (3) , 424-437
- https://doi.org/10.1109/21.364856
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Correcting dependent errors in sequences generated by finite-state processesIEEE Transactions on Information Theory, 1993
- Topology identification for traffic and configuration management in dynamic networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- SONET-a network management viewpointPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- Dynamic Programming Inference of Markov Networks from Finite Sets of Sample StringsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Inferring the structure of a Markov Chain from its outputPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Efficient regular grammatical inference for pattern recognitionPattern Recognition, 1984
- Modeling by shortest data descriptionAutomatica, 1978
- An information measure for hierarchic classificationThe Computer Journal, 1973
- On the Synthesis of Finite-State Machines from Samples of Their BehaviorIEEE Transactions on Computers, 1972
- Linear Automaton TransformationsProceedings of the American Mathematical Society, 1958