Identification in the limit of substitutable context-free languages

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

Volumn 3734 LNAI, Issue , 2005, Pages 283-296

  Clark, Alexander ^a   Eyraud, Rémi ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b EURISE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; FORMAL LANGUAGES; IDENTIFICATION (CONTROL SYSTEMS); INFERENCE ENGINES; LEARNING ALGORITHMS; POLYNOMIALS;

GRAMMATICAL INFERENCE; POLYNOMIAL IDENTIFICATION; REVERSIBILITY;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33646534596     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564089_23     Document Type: Conference Paper

References (14)

1. P. Adriaans, M. Trautwein, and M. Vervoort. Towards high speed grammar induction on large text corpora. In SOFSEM 2000, pages 173-186. Springer Verlag, 2000.
2. D. Angluin. Inference of reversible languages. Communications of the ACM, 29:741-765, 1982.
3. R. Book and F. Otto. String rewriting systems. Springer Verlag, 1993.
4. N. Chomsky. Systems of syntactic analysis. Journal of Symbolic Logic, 18(3), 1953.
5. C. de la Higuera. Characteristic sets for polynomial grammatical inference. Machine Learning, 27(2):125-138, 1997.
6. E. M. Gold. Language indentification in the limit. Information and Control, 10(5):447-474, 1967.
7. Z. Harris. Distributional structure. Word, 10(2-3):146-62, 1954.
8. J. A. Laxminarayana and G. Nagaraja. Inference of a subclass of context free grammars using positive samples. In Proceedings of the Workshop on Learning Context-Free Grammars at ECML/PKDD 2003, 2003.
9. E. Mäkinen. On inferring zero-reversible languages. Technical Report A-1998-7, University of Tampere, 1998.
10. D. Ron, Y. Singer, and N. Tishby. On the learnability and usage of acyclic probabilistic finite automata. Journal of Computer and System Sciences (JCSS), 56(2):133-152, 1998.
11. G. Senizergues. The equivalence and inclusion problems for NTS languages. J. Comput. Syst. Sci., 31(3):303-331, 1985.
12. B. Starkie. Identifying Languages in the Limit using Alignment Based Learning. PhD thesis, University of Newcastle, Australia, 2004.
13. T. Yokomori. On polynomial-time learnability in the limit of strictly deterministic automata. Machine Learning, 19(2):153-179, 1995.
14. T. Yokomori. Polynomial-time identification of very simple grammars from positive data. Theoretical Computer Science, 298(1):179-206, 2003.