Learning code regular and code linear languages

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

Volumn 1147, Issue , 1996, Pages 211-221

  Emerald, J D ^a   Subramanian, K G ^a   Thomas, D G ^a  

^a MADRAS CHRISTIAN COLLEGE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL GRAMMARS; LEARNING ALGORITHMS;

FRAME-WORK; IDENTIFICATION IN THE LIMITS; LINEAR LANGUAGE;

COMPUTATIONAL LINGUISTICS;

EID: 21444439504     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0033356     Document Type: Conference Paper

References (14)

1. A.V. Aho and M.J. Corasick, Efficient string matching: an aid to bibliographic search, Communications of the ACM 18(6), 338-340, 1975.
2. D. Angluin, Inference of reversible languages, Journal of the ACM, 29(3), 741-765, 1982.
3. J. Berstel and D. Perrin, Theory of Codes, Academic Press, New York/London, 1985.
4. E.M. Gold, Language identification in the limit, Information and Control, 10, 447-474, 1967
5. T. Head, Formal language theory and DNkaAn analysis of the generative capacity of specific recombinant behaviours, Bulletin of Mathematical Biology, 49, 737-759, 1987.
6. E. Makinen, The grammatical reference problem for the Szilard languages of linear grammars, Information Processing Letters, 36, 203-206, 1990.
7. E. Makinen, A note on the grammatical inference problem for even linear languages, Fundamenta Informaticae, 25(2), 175-181, 1996.
8. H.A. Maurer, G. Rozenberg and E. Welzl, Using string languages to describe picture languages, Information and Control, 54, 155-185, 1992.
9. V. Radhakrishnan and G. Nagaraja, Inference of even linear grammars and its application to picture description languages, Pattern Recognition, 21(1), 55-62, 1988.
10. J.M. Sempere and P. Garda, A characterisation of even linear languages and its application to the learning problem, Lecture Notes in Artificial Intelligence 914, 38-44, Springer Verlag.
11. G. Siromoney, R. Siromoney and K. Krithivasan, Abstract families of matrices and picture languages, Comp. Graphics and Image Proc., 1, 234-307, 1972.
12. Y. Takada, Grammatical inference of even linear languages based on control sets, Information Processing Letters, 28(4), 193-199, 1988.
13. N. Tanida and T. Yokomori, Polynomial time identification of strictly regular languages in the limit, IEICE Transactions on Information and Systems, E75-D, 125-132, 1992.
14. T. Yokomori, On polynomial-time learnability in the limit of strictly deterministic automata, Machine Learning, 19, 153-179, 1995.