The power of amnesia: Learning probabilistic automata with variable memory length
- 1 January 1997
- journal article
- Published by Springer Science and Business Media LLC in Machine Learning
- Vol. 25 (2-3), 117-149
- https://doi.org/10.1007/bf00114008
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Elements of Information TheoryPublished by Wiley ,2001
- Inference and minimization of hidden Markov chainsPublished by Association for Computing Machinery (ACM) ,1994
- On the learnability of discrete distributionsPublished by Association for Computing Machinery (ACM) ,1994
- Efficient learning of typical finite automata from random walksPublished by Association for Computing Machinery (ACM) ,1993
- Learning and robust learning of product distributionsPublished by Association for Computing Machinery (ACM) ,1993
- Eigenvalue Bounds on Convergence to Stationarity for Nonreversible Markov Chains, with an Application to the Exclusion ProcessThe Annals of Applied Probability, 1991
- Applications of DAWGs to Data CompressionPublished by Springer Science and Business Media LLC ,1990
- A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov ChainsThe Annals of Mathematical Statistics, 1970
- Fast Sequential Decoding Algorithm Using a StackIBM Journal of Research and Development, 1969
- Prediction and Entropy of Printed EnglishBell System Technical Journal, 1951