Learning a subclass of linear languages from positive structural information

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

Volumn 1433, Issue , 1998, Pages 162-174

  Sempere, José M ^a   Nagaraja, G ^b  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

Characterizable methods; Formal languages; Grammatical inference; Structural information

Indexed keywords

COMPUTATIONAL GRAMMARS; FORMAL LANGUAGES;

CHARACTERIZABLE METHODS; GRAMMATICAL INFERENCES; LINEAR LANGUAGE; PUMPING LEMMA; STRUCTURAL INFORMATION; STRUCTURAL SET; TIME AND SPACE COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

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

References (22)

1. V. Amar, G. PutzoluOn a Family of Linear Grammars. Information and Control 7 (1964) 283-291.
2. P. García Learning k-Testable Tree Sets from positive data. Departamento de Sistemas Informáticos y Computación. Universidad Politécnica de Valencia. Technical report DSIC-II/46/93. 1993.
3. E. Mark GoldLanguage Identification in the Limit. Information and Control, 10 (1969) 447-474.
4. M. Harrison Introduction to Formal Language Theory. Addison-Wesley Publishing Company. 1978.
5. C. de la HigueraCharacteristic Sets for Polynomial Grammatical Inference. Machine Learning 27 (1997) 125-138.
6. T. Koshiba, E. MÄkinen, Y. TakadaLearning deterministic even linear languages from positive examples. Theoretical Computer Science 185(1997) 63-97.
7. E. MÄkinenThe grammatical inference problem for the Szilard languages of Linear Grammars. Information Processing Letters 36 (1990) 203-206.
8. E. MÄkinenOn the structural grammatical inference problem for some classes of context-free grammars. Information Processing Letters 42(1992) 1-5.
9. E. MÄkinenRemarks on the structural grammatical inference problem for context-free grammars. Information Processing Letters 44 (1992) 125-127.
10. E. MäkinenA note on the grammatical inference problem for even linear languages. Fundamenta Informaticae 25, No. 2 (1996) 175-181.
11. V. RadhakrishnanGrammatical Inference from Positive Data: An Effective Integrated Approach. Ph.D. Thesis. Department of Computer Science and Engineering. HT Bombay. 1987.
12. V. Radhakrishnan and G. NagarajaInference of Regular Grammars via Skeletons. IEEE Trans. on Systems, Man and Cybernetics, 17, No. 6 (1987) 982-992.
13. V. Radhakrishnan and G. NagarajaInference of Even Linear Languages and Its Application to Picture Description Languages. Pattern Recognition, 21, No. 1 (1988) 55-62.
14. G. RozenbergDirect Proofs of the Undecidability of the Equivalence Problem for Sentential Forms of Linear Context-Free Grammars and the Equivalence Problem for 0L Systems. Information Processing Letters 1 (1972) 233-235.
15. J. Ruiz and P. GarcíaThe algorithms RT and k-TTI: A first comparison. Proceedings of the Second International Colloquium, ICGI-94. LNAI Vol. 862, pp 180-188. 1994.
16. Y. SakakibaraLearning context-free grammars from structural data in polynomial time. Theoretical Computer Science 76 (1990) 223-242.
17. Y. SakakibaraEfficient Learning of Context-Free Grammars from Positive Structural Examples. Information and Computation 97 (1992) 23-60.
18. J.M. Sempere and P. García A Characterization of Even Linear Languages and its Application to the Learning Problem. Proceedings of the Second International Colloquium, ICGI-94. LNAI Vol. 862, pp 38-44. Springer-Verlag. 1994.
19. José M. Sempere and Antonio FosLearning linear grammars from Structural Information. Proceedings of the Third International Colloquium, ICGI-96. LNAI Vol. 1147, pp 126-133. Springer-Verlag. 1996.
20. Y. TakadaInferring Parenthesis Linear Grammars Based on Control Sets. Journal of Information Processing, 12, No. 1 (1988) 27-33.
21. Y. TakadaGrammatical Inference for Even Linear Languages based on Control Sets. Information Processing Letters. 28, No. 4 (1988) 193-199.
22. Y. TakadaA hierarchy of languages families learnable by regular language learning. Information and Computation, 123(1) (1995) 138-145.