Inferring finite automata with stochastic output functions and an application to map learning
- 1 January 1995
- journal article
- Published by Springer Nature in Machine Learning
- Vol. 18 (1) , 81-108
- https://doi.org/10.1007/bf00993822
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Learning dynamics: system identification for perceptually challenged agentsArtificial Intelligence, 1995
- Controlling eye movements with hidden Markov modelsInternational Journal of Computer Vision, 1991
- Learning to perceive and act by trial and errorMachine Learning, 1991
- Robotic exploration as graph constructionIEEE Transactions on Robotics and Automation, 1991
- Learning regular sets from queries and counterexamplesInformation and Computation, 1987
- A theory of the learnableCommunications of the ACM, 1984
- An Introduction to the Application of the Theory of Probabilistic Functions of a Markov Process to Automatic Speech RecognitionBell System Technical Journal, 1983
- On the complexity of minimum inference of regular setsInformation and Control, 1978
- Complexity of automaton identification from given dataInformation and Control, 1978
- System identification via state characterizationAutomatica, 1972