Learning commutative deterministic finite state automata in polynomial time
- 1 February 1991
- journal article
- Published by Springer Nature in New Generation Computing
- Vol. 8 (4) , 319-335
- https://doi.org/10.1007/bf03037090
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The minimum consistent DFA problem cannot be approximated within any polynomialPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Prediction-preserving reducibilityJournal of Computer and System Sciences, 1990
- Learning Integer LatticesPublished by Elsevier ,1990
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Crytographic limitations on learning Boolean formulae and finite automataPublished by Association for Computing Machinery (ACM) ,1989
- From On-line to Batch LearningPublished by Elsevier ,1989
- Predicting (0, 1)-functions on randomly drawn pointsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability and Its Applications, 1971