Dana Ron
- Ang87.D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87-106, 1987. Google Scholar
Digital Library
- AL88.D. Angluin and P. Laird. Learning from noisy examples. Machine Learning, 2:343-370, 1988. Google ScholarDigital Library
- AS91.D. Angluin and D. Slonim. Learning monotone DNF with an incomplete membership oracle. In Proceedings of the 3rd Annual Workshop on Computational Learning Theory, pages 246-257. Morgan Kaufmann Publishers, Inc., San Mateo, CA, 1991 Google ScholarDigital Library
- BEHW87.A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth. Occam's razor. Information Processing Letters, 24:377-380, 1987. Google ScholarDigital Library
- FKRRSS93.Y. Fretmd, M. J. Kearns, D. Ron, R. Rubinfeld, R. E. Schapire, and L. SeUie. Efficient Learning of Typical Finite Automata from Random Walks. To appear in Proceedings of the ~5th Annual ACM Symposium on Theory of Computing. ACM Press, 1993. Google ScholarDigital Library
- GKS90.S.A. Goldman, M. J. Kearns, and R. E. Schapire. Exact identification of circuits using fixed points of amplification functions. In Proceedings of the 81st Annual Symposium on Foundations of Computer Science, pages 193-202. IEEE Computer Society Press, 1990.Google ScholarDigital Library
- GM92.S.A. Goldman and H. D. Mathias. Learning kterm DNF Formulas with an Incomplete Membership Oracle. In Proceedings of the 5th Annual Workshop on Computatwnal Learning Theory, pages 85-92. Morgan Kaufmann Publishers, Inc., Pittsburgh, PA, 1992. Google ScholarDigital Library
- Kea93.M. Kearns. Efficient Noise-Tolerant Learning From Statisticai Queries. To appear in Proceedings of the 25th Annual A CM Symposium on Theory of Computing. ACM Press, 1993. Google ScholarDigital Library
- KL88.M. Kearns and M. Li. Learning in the presence of malicious errors. In Proceedings of the ~Oth Annual A CM Symposium on Theory of Computing, pages 267-280. ACM Press, 1988. Google ScholarDigital Library
- KV89.M. Kearns and L. Valiant. Cryptographic limitations on learning boolean formulae and finite automata. In Proceedings of the ~1st Annual ACM Symposium on Theory of Computing, pages 433- 444. ACM Press, 1989. Google ScholarDigital Library
- PW90.L. Pitt and M. Warmuth. Prediction-preserving reducibility. J. of Computer and System Sczences, 41:430-467, 1990. Google ScholarDigital Library
- RR92.D. Ron and R. Rubinfeld. Learning and Correcting Fallible Finite State Automata. Technical Report 92-14, Hebrew University Department of Computer Science, 1992.Google Scholar
- RS87.R. Rivest and R. Schapire. Diversity-based inference of finite automata. In Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pages 78-87. IEEE Computer Science Press, 1987.Google ScholarDigital Library
- RS89.R. Rivest and R. Schapire. Inference of finite automata using homing sequences. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 411-420. ACM Press, 1989. Google ScholarDigital Library
- Sak91.Y. Sakakibara. On learning from queries and counterexamples in the presence of noise. Information Processing Letters, 37:279-284, 1991. Google ScholarDigital Library
- Slo88.R.H. Sloan. Types of noise in data for concept learning. In Proceedings of the 1988 Workshop on Computational Learning Theory, pages 91-96. Morgan Kaufmann Publishers, Inc., San Mateo, CA, 1988. Google ScholarDigital Library
- SS92.Y. Sakakibara and Rani Siromoney. A Noise Model on Learning Sets of Strings. In Proceedings of the 5th Annual Workshop on Computational Learning Theory, pages 295-302. Morgan Kaufmann Publishers, Inc., Pittsburgh, PA, 1992. Google ScholarDigital Library
- SV88.G. Shackelford and D. Volper. Learning k-DNF with noise in the attributes. In Proceedings of the 1988 Workshop on Computational Learning Theory, pages 97-103. Morgan Kaufmann Publishers, Inc., San Mateo, CA, 1988. Google ScholarDigital Library
- Val84.L.G. Valiant. A theory of the learnable. Communications of the ACM, 27:1134-1142, 1984. Google ScholarDigital Library
- Val85.L.G. Valiant. Learning disjunctions of conjunctions. In Proceedings of the 9th International Jo,nt Conference on Artsficial Inteligence, pages 560-566. Morgan Kaufmann, 1985.Google Scholar
Index Terms
- Learning fallible finite state automata
Recommendations
On the power of quantum finite state automata
FOCS '97: Proceedings of the 38th Annual Symposium on Foundations of Computer ScienceIn this paper, we introduce 1-way and 2-way quantum finite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and probabilistic 1-way and 2-way finite state automata. We prove the following facts ...
Residual Finite State Automata
STACS '01: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer ScienceWe introduce a subclass of non deterministic finite automata (NFA) that we call Residual Finite State Automata (RFSA): a RFSA is a NFA all the states of which define residual languages of the language it recognizes. We prove that for every regular ...
State complexity of unambiguous operations on finite automata
AbstractThe paper determines the number of states in finite automata necessary to represent “unambiguous” variants of the union, concatenation, and Kleene star operations on formal languages. For the disjoint union of languages represented by ...
Comments