Limits of Pure Grammars with Monotone Productions

Fundamenta Informaticae

Volumn 33, Issue 3, 1998, Pages 265-280

  Martinek, Pavel ^a  

^a MENDEL UNIVERSITY IN BRNO   (Czech Republic)

Author keywords

1 grammatizable language; Grammatical inference problem; Language generated by pure grammars; Limits of pure grammars; Monotone (or non shortening) productions; Pure (or special) grammar; Pure grammar with monotone (or non shortening) productions

Indexed keywords

EID: 0012038152     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1998-33304     Document Type: Article

References (8)

1. Gonzalez, R. C. - Thomason, M. G.: Syntactic Pattern Recognition: An Introduction, Addison-Wesley, Reading 1978.
2. Halmos, P. R.: Measure Theory, Van Nostrand, New York 1950.
3. Novotný, M.: Construction of grammars for formal languages, Mathematical Foundations of Computer Science. Proceedings of Symposium and Summer-School. High Tatras, September 3-8, 1973, 125-133.
4. Novotný, M.: On some operators reducing generalized grammars, Information and Control 26 (1974), 225-235.
5. Novotný, M.: Effective construction of grammars, Banach Center Publications, vol. 21, PWN - Polish Scientific Publishers. Warsaw 1988.
6. Novotný, M.: S algebrou od jazyka ke gramatice a zpět (With algebra from language to grammar and back), Academia, Prague 1988.
7. Ostravský, J.: Effective construction of grammars for languages of two particular classes, Fundamenta Informaticae 8 (1985), 235-252.
8. Ostravský, J.: An algorithm for effective constructions of grammars, Bulletin of the Polish Academy of Sciences, Mathematics, vol. 36, No. 11-12, 1988, 710-719.