Regular closure of deterministic languages

SIAM Journal on Computing

Volumn 29, Issue 1, 1999, Pages 81-102

  Bertsch, Eberhard ^a   Nederhof, Mark Jan ^b  

^a RUHR UNIVERSITY BOCHUM   (Germany)

^b GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; LINEARIZATION;

DETERMINISTIC LANGUAGES;

CONTEXT FREE LANGUAGES;

EID: 0342733649     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979528682X     Document Type: Article

References (16)

1. A. AHO, J. HOPCROFT, AND J. ULLMAN, Time and tape complexity of pushdown automaton languages, Inform. and Control, 13 (1968), pp. 186-206.
2. J. BATES AND A. LAVIE, Recognizing substrings of LR(k) languages in linear time, ACM Transactions on Programming Languages and Systems, 16 (1994). pp. 1051-1077.
3. J. BERSTEL, Transductions a ad Contort-Free Languages, B.G. Teubner, Stuttgart, 1979.
4. E. BERTSCH, An Asymptotically Optimal Algorithm for Non-correcting LL(1) Error Recovery, Bericht 176, Fakultät für Mathematik, Ruhr-Universität Bochum, Bochum, Germany, 1994.
5. E. BERTSCH AND M. NEDERHOF, Regular Closure of Deterministic Languages, Bericht 186, Fakultät für Mathematik, Ruhr-Universität Bochum, Bochum, Germany, 1995.
6. S. BILLOT AND B. LANG, The structure of shared forests in ambiguous parsing, in 27th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, Vancouver, BC, Canada, 1989, pp. 143-151.
7. J. EARLEY, An efficient context-free parsing algorithm, Communications of the ACM, 13 (1970), pp. 94-102.
8. M. HARRISON, Introduction to Formal Language Theory, Addison-Wesley, Reading, MA, 1978.
9. J. HOPCROFT AND J. ULLMAN. Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
10. D. KNUTH, J. MORRIS, JR., AND V. PRATT, Fast pattern matching in strings, SIAM J. Comput., 6 (1977), pp. 323-350.
11. B. LANG, Deterministic techniques for efficient non-deterministic parsers, in Automata, Languages and Programming, 2nd Colloquium, Saarbrücken, Lecture Notes in Comput. Sci. 14, Springer-Verlag, New York, 1974, pp. 255-269.
12. M. NEDERHOF, Linguistic Parsing and Program Transformations, Ph.D. thesis, University of Nijmegen, Nijmegen, the Netherlands, 1991.
13. M. NEDERHOF AND E. BERTSCH, Linear-time suffix parsing for deterministic languages, J. ACM, 43 (1996), pp. 524-554.
14. M. NEDERHOF AND G. SATTA, Efficient tabular LR parsing, in 34th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, Santa Cruz, CA, 1996, pp. 239-246.
15. H. RICHTER, Noncorrecting syntax error recovery, ACM Transactions on Programming Languages and Systems, 7 (1985), pp. 478-489.
16. L. VALIANT, General context-free recognition in less than cubic time, J. Comput. System Sci., 10 (1975), pp. 308-315.