The language intersection problem for non-recursive context-free grammars

Information and Computation

Volumn 192, Issue 2, 2004, Pages 172-184

  Nederhof, Mark Jan ^a   Satta, Giorgio ^b  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

Computational complexity; Context free grammars; Formal languages; Parsing algorithms

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; CONTEXT FREE GRAMMARS; POLYNOMIALS; PROBLEM SOLVING;

INSTANTANEOUS DESCRIPTION; LINEAR BOUNDED AUTOMATION (LBA); PARSING ALGORITHMS;

CONTEXT FREE LANGUAGES;

EID: 3042662535     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.03.004     Document Type: Article

References (20)

1. Aho A.V., Ullman J.D. Parsing, vol. 1 of The Theory of Parsing, Translation and Compiling. 1972;Prentice-Hall, Englewood Cliffs, NJ.
2. Bar-Hillel Y., Perles M., Shamir E. On formal properties of simple phrase structure grammars. Bar-Hillel Y. Language and Information: Selected Essays on their Theory and Application. 1964;116-150 Addison-Wesley, Reading, MA. Chapter 9.
3. S.A. Cook, Path systems and language recognition, in: ACM Symposium on Theory of Computing, 1970, pp. 70-72.
4. Gibbons A., Rytter W. Efficient Parallel Algorithms. 1988;Cambridge University Press, Cambridge.
5. Harrison M.A. Introduction to Formal Language Theory. 1978;Addison-Wesley, Reading, MA.
6. J. Hartmanis, Context-free languages and Turing machine computations, in: J.T. Schwartz (Ed.), Proceedings of a Symposium in Applied Mathematics, vol. 19, 1967, pp. 42-51.
7. Hopcroft J.E., Ullman J.D. Introduction to Automata Theory, Languages, and Computation. 1979;Addison-Wesley, Reading, MA.
8. Hunt III H.B. On the decidability of grammar problems. J. ACM. 29(2):1982;429-447.
9. Hunt III H.B. Terminating Turing machine computations and the complexity and/or decidability of correspondence problems, grammars, and program schemes. J. ACM. 31(2):1984;299-318.
10. Hunt III H.B., Rosenkrantz D.J., Szymanski T.G. On the equivalence, containment, and covering problems for the regular and context-free languages. J. Comput. Syst. Sci. 12:1976;222-268.
11. Immerman N. Nondeterministic space is closed under complementation. SIAM J. Comput. 17(5):1988;935-938.
12. K. Knight, I. Langkilde, Preserving ambiguities in generation via automata intersection, in: Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, Austin, Texas, USA, July-August 2000, pp. 697-702.
13. D. Kozen, Lower bounds for natural proof systems, in: 18th Annual Symposium on Foundations of Computer Science, 1977, pp. 254-266.
14. I. Langkilde, Forest-based statistical sentence generation, in: 6th Applied Natural Language Processing Conference and 1st Meeting of the North American Chapter of the Association for Computational Linguistics (Section 2), Seattle, Washington, USA, April-May 2000, pp. 170-177.
15. Lewis H.R., Papadimitriou C.H. Elements of the Theory of Computation. 1981;Prentice-Hall, Englewood Cliffs, NJ.
16. P.M. Lewis II, R.E. Stearns, J. Hartmanis, Memory bounds for recognition of context-free and context-sensitive languages, in: Conference Record of the 6th Annual Symposium on Switching Circuit Theory and Logical Design, 1965, pp. 191-202.
17. McAllester D. On the complexity analysis of static analyses. J. ACM. 49(4):2002;512-537.
18. A.R. Meyer, L.J. Stockmeyer, The equivalence problem for regular expressions with squaring requires exponential space, in: Conference Record of the 13th IEEE Symposium on Switching and Automata Theory, 1972, pp. 125-129.
19. M.-J. Nederhof, G. Satta, Parsing non-recursive context-free grammars, in: 40th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, Philadelphia, Pennsylvania, USA, July 2002, pp. 112-119.
20. S. Sippu, E. Soisalon-Soininen, Parsing Theory, vol. I: Languages and Parsing, vol. 15 of EATCS Monographs on Theoretical Computer Science, Springer, Berlin, 1988.