An operational and denotational approach to non-context-freeness

Theoretical Computer Science

Volumn 293, Issue 2, 2003, Pages 261-289

  Kolb, Hans Peter ^a   Michaelis, Jens ^b   Mönnich, Uwe ^c   Morawietz, Frank ^c  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF POTSDAM   (Germany)

^c UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

MSO logic; Non context free phenomena; Tree Grammars

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONTEXT FREE LANGUAGES; FORMAL LOGIC; TREES (MATHEMATICS);

TREE GRAMMARS;

CONTEXT FREE GRAMMARS;

EID: 0037421571     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00348-6     Document Type: Conference Paper

References (41)

1. R. Bloem, J. Engelfriet, Characterization of properties and relations defined in Monadic Second Order logic on the nodes of trees, Technical Report 97-03, Department of Computer Science, Leiden University, 1997.
2. Büchi J.R. Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlag. Math. 6:1960;66-92.
3. Chomsky N. Barriers. 1985;MIT Press, Cambridge, MA.
4. Courcelle B. Graph rewriting: An algebraic and logic approach. van Leeuwen J. Handbook of Theoretical Computer Science, Vol. B. 1990;193-242 Elsevier, Amsterdam.
5. Courcelle B. The monadic second-order logics of graphs VII: Graphs as relational structures. Theoret. Comput. Sci. 102:1992;3-33.
6. B. Courcelle, The expression of graph properties and graph transformations in monadic second-order logic, in: G. Rozenberg (Ed.), Handbook of Graph Grammars and Computing by Graph Transformation. Vol. I: Foundations, World Scientific, Singapore, 1997, pp. 313-400 (Chapter 5).
7. Doner J.E. Tree acceptors and some of their applications. J. Comput. System Sci. 4:1970;406-451.
8. Elgot C.C. Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc. 98:1961;21-51.
9. Engelfriet J., Maneth S. Macro tree transducers, attribute grammars, and MSO definable tree translations. Inform. Comput. 154:1999;34-91.
10. Engelfriet J., Maneth S. Tree languages generated by context-free graph grammars. Ehrig H.-J.K.H., Engels G., Rozenberg G. Proceedings of Theory and Applications of Graph Transformations - TAGT'98. Lecture Notes in Computer Science. Vol. 1764:2000;15-29 Springer, Berlin.
11. Engelfriet J., Schmidt E.M. IO and OI, part I. J. Comput. System Sci. 15:1977;328-353.
12. Engelfriet J., Schmidt E.M. IO and OI, part II. J. Comput. System Sci. 16:1978;67-99.
13. Engelfriet J., van Oostrom V. Regular description of context-free graph languages. J. Comput. System Sci. 53(3):1996;556-574.
14. Engelfriet J., Vogler H. Macro tree transducers. J. Comput. System Sci. 31(1):1985;71-146.
15. M.J. Fischer, Grammars with macro-like productions, Proceedings of the 9th Annual Symposium on Switching and Automata Theory, IEEE, New York, 1968, pp. 131-142.
16. R. Frank, K. Vijay-Shanker, Primitive c-command, Johns Hopkins University and Universtiy of Delaware, Baltimore, MO, 1998.
17. Gécseg F., Steinby M. Tree Automata. 1984;Akadémiai Kiadó Budapest.
18. Gécseg F., Steinby M. Tree languages. Rozenberg G., Salomaa A. Handbook of Formal Languages: Beyond Words, Vol. 3. 1997;Springer, Berlin.
19. Huybregts M.A.C. Overlapping dependencies in Dutch. Utrecht Working Papers in Linguistics. 1:1976;24-65.
20. Huybregts M.A.C. The weak adequacy of context-free phrase structure grammar. de Haan G.J., Trommelen M., Zonneveld W. Van periferie naar kern. 1984;81-99 Foris, Dordrecht.
21. Immerman N. Languages that capture complexity classes. SIAM J. Comput. 16(4):1987;760-778.
22. Kolb H.-P., Mönnich U., Morawietz F. Descriptions of cross-serial dependencies. Grammars. 3(2/3):2000;189-216.
23. Maibaum T.S.E. A generalized approach to formal languages. J. Comput. System Sci. 88:1974;409-439.
24. Mezei J., Wright J.B. Algebraic automata and contextfree sets. Inform. Control. 11:1967;3-29.
25. J. Michaelis, Derivational minimalism is mildly context-sensitive, Linguistics in Potsdam (LiP) 5, Institut für Linguistik, Universität Potsdam, 1999. Available under http://www.ling.uni-potsdam.de/ ̃michael/.
26. Michaelis J., Kracht M. Semilinearity as a syntactic invariant. Retoré C. Proc. 1st Internat. Conf. on Logical Aspects of Computational Linguistics (LACL-96), Vol. 1328 of LNAI. 1997;329-345 Springer, Berlin.
27. J. Michaelis, U. Mönnich, F. Morawietz, Algebraic descriptions of derivational minimalism, Algebraic Methods in Language Processing: Second AMAST Workshop on Language Processing, TWLT, Parlevink, University of Iowa, 2000a.
28. J. Michaelis, U. Mönnich, F. Morawietz, Derivational minimalism in two regular and logical steps, Proc. Tag+5 Conference, Paris, 2000b.
29. J. Michaelis, U. Mönnich, F. Morawietz, On minimalist attribute grammars and macro tree transducers, 2000c. Draft available under http://tcl.sfs.nphil.uni-tuebingen.de/ ̃frank/.
30. U. Mönnich, Lexikalisch kontrollierte Kreuzabhängigkeiten und Kongruenzmorphologien, Talk at the Innovationskolleg Potsdam, 1997. Available under http://tcl.sfs.nphil.uni-tuebingen.de/ ̃tcl/uwe/uwe_moennich.html.
31. U. Mönnich, On cloning contextfreeness, in: H.-P. Kolb, U. Mönnich (Eds.), The Mathematics of Syntactic Structure, Studies in Generative Grammar, Vol. 44, Mouton de Gruyter, Paris, 1999, pp. 195-229.
32. Peters P.S., Ritchie R.W. On the generative power of transformational grammars. Inform. Sci. 6:1973;49-83.
33. Pullum G., Gazdar G. Natural languages and context-free languages. Linguist. Philos. 4(4):1982;471-504.
34. J. Rogers, A Descriptive Approach to Language-Theoretic Complexity, Studies in Logic, Language and Information, CSLI and FOLLI, 1998.
35. W.C. Rounds, Tree-oriented proofs of some theorems on context-free and indexed languages. Proc. 2nd Annu. ACM Symp. on Theory of Computing, 1970, pp. 109-116.
36. Seki H., Matsumura T., Fujii M., Kasami T. On multiple context-free grammars. Theoret. Comput. Sci. 88(2):1991;191-229.
37. Shieber S.M. Evidence against the context-freeness of natural language. Linguist. Philos. 8(3):1985;333-344.
38. E. Stabler, Derivational minimalism, in: C. Retoré (Ed.), Logical Aspects of Computational Linguistics, Springer, Berlin, 1997, pp. 68-95. LNAI 1328.
39. Thatcher J.W., Wright J.B. Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Systems Theory. 2(1):1968;57-81.
40. W. Thomas, Automata on infinite objects, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, pp. 133-191 (Chapter 4).
41. Vijay-Shanker K., Weir D.J. The equivalence of four extensions of context-free grammars. Math. Systems Theory. 27(6):1994;511-546.