Polynomial-time identification of an extension 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 4201 LNAI, Issue , 2006, Pages 45-58

  Yoshinaka, Ryo ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIALS; PROBLEM SOLVING;

CARDINALITY; CONJECTURE; RIGHT-UNIQUE SIMPLE GRAMMARS;

CONTEXT FREE GRAMMARS;

EID: 33750285020     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11872436_5     Document Type: Conference Paper

References (9)

1. Gold, E.M.: Language identification in the limit. Information and Control 10(5) (1967) 447-474
2. Yokomori, T.: Polynomial-time identification of very simple grammars from positive data. Theoretical Computer Science 298 (2003) 179-206
3. Wakatsuki, M., Teraguchi, K., Tomita, E.: Polynomial time identification of strict deterministic restricted one-counter automata in some class from positive data. In: Proceedings of the 7th International Colloquium on Grammatical Inference. Volume 3264 of Lecture Notes in Computer Science. (2004) 260-272
4. Linna, M.: Two decidability results for deterministic pushdown automata. Journal of Computer and System Science 18 (1979) 92-107
5. Greibach, S.A., Friedman, E.P.: Superdeterministic PDAs: A subcase with a decidable inclusion problem. Journal of the Association for Computing Machinery 27(4) (1980) 675-700
6. Shibata, T., Yoshinaka, R., Chikayama, T.: Probabilistic generalization of simple grammars and its application to reinforcement learning. In: Proceedings of the 17th International Conference on Algorithmic Learning Theory. Lecture Notes in Artificial Intelligence, Barcelona (2006) to appear.
7. Angluin, D.: Inference of reversible languages. Journal of the Association for Computing Machinery 20(3) (1982) 741-765
8. 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) (1993) 1224-1233
9. Angluin, D.: Inductive inference of formal languages from positive data. Information and Control 45(2) (1980) 117-135