On the computational complexity of approximating distributions by probabilistic automata

This publication has 9 references indexed in Scilit:

• The minimum consistent DFA problem cannot be approximated within any polynomial
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• Learnability and the Vapnik-Chervonenkis dimension
  Journal of the ACM, 1989
• The equivalence and learning of probabilistic automata
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• Convergence of Stochastic Processes
  Published by Springer Nature ,1984
• An Introduction to the Application of the Theory of Probabilistic Functions of a Markov Process to Automatic Speech Recognition
  Bell System Technical Journal, 1983
• On the complexity of minimum inference of regular sets
  Information and Control, 1978
• Complexity of automaton identification from given data
  Information and Control, 1978
• Computational Complexity of Probabilistic Turing Machines
  SIAM Journal on Computing, 1977
• A lower bound for discrimination information in terms of variation (Corresp.)
  IEEE Transactions on Information Theory, 1967