Characteristic Sets for Polynomial Grammatical Inference

Machine Learning

Volumn 27, Issue 2, 1997, Pages 125-138

  De La Higuera, Colin ^a  

^a LIRMM   (France)

Author keywords

Exact identification; Grammatical inference; Polynomial learning

Indexed keywords

CONTEXT FREE GRAMMARS; FINITE AUTOMATA; INFERENCE ENGINES; LEARNING ALGORITHMS; POLYNOMIALS; THEOREM PROVING;

CHARACTERISTIC SETS; GRAMMATICAL INFERENCE;

LEARNING SYSTEMS;

EID: 0031144535     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007353007695     Document Type: Article

References (27)

1. Angluin, D. (1987). Queries and concept learning. Machine Learning, 2:319-342.
2. Angluin, D., & Kharitonov, M. (1995). When won't membership queries help? Journal of Computer and System Sciences, 50(1):336-355.
3. Anthony, M., Brightwell, G., Cohen, D., & Shawe-Taylor, J. (1992). On exact specification by examples. Proceedings of COLT'92 (pp. 311-318). A.C.M.
4. Castellanos, A., Galiano I., & Vidal, E. (1994). Application of OSTIA to machine translation tasks. Proceedings of the International Colloquium on Grammatical Inference ICGI-94 (pp. 93-105). Lecture Notes in Artificial Intelligence (Vol. 862). Springer-Verlag.
5. Freivalds, R., Kinber, E.B., & Wiehagen, R. (1989). Inductive inference from good examples. Proceedings of the International Workshop on Analogical and Inductive Inference (pp. 1-17). Lecture Notes in Artificial Intelligence (Vol. 397). Springer-Verlag.
6. García, P., Segarra, E., Vidal, E., & Galiano, I. (1994). On the use of the morphic generator grammatical inference (MGGI) methodology in automatic speech recognition. International Journal of Pattern Recognition and Artificial Intelligence, 4:667-685.
7. García, P., & Vidal, E. (1990). Inference of K-testable languages in the strict sense and applications to syntactic pattern recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12(9):920-925.
8. Garey, M.R., & Johnson, D.S. (1979). Computers and Intractability: A guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman.
9. Gold, E.M. (1967). Language identification in the limit. Inform. & Control, 10:447-474.
10. Gold, E.M. (1978). Complexity of automaton identification from given data. Information and Control, 37:302-320.
11. Goldman, S.A., & Kearns, M.J. (1995). On the complexity of teaching. Journal of Computer and System Sciences, 50(1):20-31.
12. Goldman, S.A., & Mathias, H.D. (1996). Teaching a smarter learner. Journal of Computer and System Sciences, 50(2):255-267.
13. Harrison, M.A. (1978). Introduction to Formal Language Theory. Reading: Addison-Wesley.
14. Heath-Brown, D., & Iwaniec, H. (1979). Invent. Math., 55:49-69.
15. Ishizaka, H. (1989). Learning simple deterministic languages. Proceedings of COLT'89 (pp. 162-174). A.C.M.
16. Jackson, J., & Tomkins, A. (1992). A computational model of teaching. Proceedings of COLT'92 (pp. 319-326). A.C.M.
17. Koshiba, T., Makinen, E., & Takada, Y. (1995). Learning deterministic even linear languages from positive examples. Proceedings of ALT'95, Lecture Notes in Artificial Intelligence (Vol. 997). Springer-Verlag.
18. Mathias, H.D. (1995). If you can't learn 'em teach 'em. In Proceedings of COLT'95.
19. Oncina, J., & García, P. (1992). Inferring regular languages in polynomial time. In Pattern Recognition and Image Analysis, World Scientific.
20. Oncina, J., García, P., & Vidal E. (1993). Learning subsequential transducers for pattern recognition tasks. IEEE Transactions on Pattern Analysis and Machine Intelligence 15:448-458.
21. Pitt, L. (1989). Inductive inference, dfas and computational complexity. Proceedings of the International Workshop on Analogical and Inductive Inference (pp. 18-44). Lecture Notes in Artificial Intelligence (Vol. 397). Springer-Verlag.
22. Sempere, J.M., & García, P. (1994). A characterisation of even linear languages and its application to the learning problem. Proceedings of the International Colloquium on Grammatical Inference ICGI-94 (pp. 38-44). Lecture Notes in Artificial Intelligence (Vol. 862). Springer-Verlag.
23. Shinohara, A., & Miyano, S. (1991). Teachability in computational learning. New Generation Computing 8:337-347.
24. Takada, Y. (1988). Grammatical inference for even linear languages based on control sets. Information Processing Letters, 28:193-199.
25. Takada, Y. (1994). A hierarchy of language families learnable by regular language learners. Proceedings of the International Colloquium on Grammatical Inference ICGI-94 (pp. 16-24). Lecture Notes in Artificial Intelligence (Vol. 862). Springer-Verlag.
26. Wiehagen, R. (1992). From inductive inference to algorithmic learning theory. Proceedings of ALT'92 (pp. 13-24). Lecture Notes in Artificial Intelligence (Vol. 743). Springer-Verlag.
27. Yokomori, T. (1993). Learning nondeterministic finite automata from queries and counterexamples. Machine Intelligence, vol. 13. Furukawa, Michie & Muggleton (Eds.), Oxford Univ. Press.