Strongly regular grammars and regular approximation of context-free languages

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

Volumn 5583 LNCS, Issue , 2009, Pages 207-220

  Eǧecioǧlu, Ömer ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT-FREE GRAMMARS; LOOK-AHEAD; REGULAR GRAMMAR; REGULAR LANGUAGES;

LINGUISTICS; QUERY LANGUAGES;

CONTEXT FREE LANGUAGES;

EID: 69049098280     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02737-6_16     Document Type: Conference Paper

References (8)

1. Anselmo, M., Giammarresi, D., Varricchio, S.: Non-self-embedding grammars as representation for regular languages. In: CIAA Conference Proceedings (2002)
2. Chomsky, N.: A note on phrase structure grammars. Information and Control 4(2), 386-392 (1959)
3. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Co., Reading (1979)
4. Mohri, M., Nederhof, M.-J.: Regular approximation of context-free grammars through transformation. In: Robustness in Language and Speech Technology, vol. 9, pp. 251-261. Kluwer Academic Publishers, Dordrecht (2000)
5. Mohri, M., Pereira, F.N.: Dynamic compilation of weighted context-free grammars. In: 36th Annual Meeting of the ACL and 17th International Conference on Computational Linguistics, vol. 2, pp. 891-897 (1998)
6. Nederhof, M.-J.: Regular approximation of cfls: A grammatical view. In: International Workshop on Parsing Technologies, pp. 159-170. MIT Press, Cambridge (1997)
7. Shallit, J.: Automaticity and rationality. J. of Automata, Languages and Combinatorics 5(3), 255-268 (2000)
8. Ullian, J.S.: Partial algorithm problems for context free languages. Information and Control 11, 80-101 (1967)