Learning efficiency of very simple grammars from positive data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4754 LNAI, Issue , 2007, Pages 227-241

  Yoshinaka, Ryo ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DATA ACQUISITION; IDENTIFICATION (CONTROL SYSTEMS); LEARNING ALGORITHMS; POLYNOMIALS;

GRAMMARS; INCONSISTENT LEARNING; POSITIVE DATA;

LEARNING SYSTEMS;

EID: 38149007133     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75225-7_20     Document Type: Conference Paper

References (14)

1. Pitt, L.: Inductive inference, DFAs, and computational complexity. In: Jantke, K.P. (ed.) AII 1989. LNCS, vol. 397, pp. 18-44. Springer, Heidelberg (1989)
2. Lange, S., Wiehagen, R.: Polynomial-time inference of arbitrary pattern languages. New Generation Computing 8, 361-370 (1991)
3. de la Higuera, C.: Characteristic sets for polynomial grammatical inference. Machine Learning 27, 125-138 (1997)
4. Takada, Y.: Grammatical inference for even linear languages based on control sets. Information Processing Letters 28, 193-199 (1988)
5. Clark, A., Eyraud, R.: Identification in the limit of substitutable context-free languages. In: Jain, S., Simon, H.U., Tomita, E. (eds.) ALT 2005. LNCS (LNAI), vol. 3734, pp. 283-296. Springer, Heidelberg (2005)
6. Yokomori, T.: Polynomial-time identification of very simple grammars from positive data. Theoretical Computer Science 298, 179-206 (2003)
7. Wakatsuki, M., Teraguchi, K., Tomita, E.: Polynomial time identification of strict deterministic restricted one-counter automata in some class from positive data. In: Paliouras, G., Sakakibara, Y. (eds.) ICGI 2004. LNCS (LNAI), vol. 3264, pp. 260-272. Springer, Heidelberg (2004)
8. Yoshinaka, R.: Polynomial-time identification of an extension of very simple grammars from positive data. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 45-58. Springer, Heidelberg (2006)
9. Yokomori, T.: Erratum to Polynomial-time identification of very simple grammars from positive data [Theoret. Comput. Sci. 298 (2003) 179-206]. Theoretical Computer Science 377(1-3), 282-283 (2007)
10. Yokomori, T.: On polynomial-time learnability in the limit of strictly deterministic automata. Machine Learning 19, 153-179 (1995)
11. Angluin, D.: Inference of reversible languages. Journal of the Association for Computing Machinery 29(3), 741-765 (1982)
12. Angluin, D.: Finding patterns common to a set of strings. Journal of Computer and System Sciences 21(1), 46-62 (1980)
13. Wakatsuki, M., Tomita, E.: A fast algorithm for checking the inclusion for very simple deterministic pushdown automata. IEICE transactions on information and systems E76-D(10), 1224-1233 (1993)
14. Wiehagen, R., Zeugmann, T.: Ignoring data may be the only way to learn efficiently. Journal of Experimental and Theoretical Artificial Intelligence 6, 131-144 (1994)