Abstract
The main result of this paper is a description of cross-serial dependencies equivalently in terms of (a) regular tree languages (to express the recursive properties) and regular string languages (to establish the intended linguistic relations) and (b) transductions definable in monadic second-order (MSO) logic which are defined on a domain of finite trees that is characterized as the model set of a closed MSO formula. In fact, we shall not deal directly with the two types of regular language families and MSO definable structures, but shall instead consider implementation in the form of finite-state (tree) automata to emphasize the effective nature of our approach.
Similar content being viewed by others
References
Aho, A.V. and J.D. Ullman. Translations on a Context-Free Grammar, Information and Control19: 439–475, 1971
Bloem, R. and J. Engelfriet. Characterization of Properties and Relations Defined in Monadic Second Order Logic on the Nodes of Trees. Technical Report97-03, Dept. of Computer Science, Leiden University, 1997.
Büchi, J.R. Weak Second-Order Arithmetic and Finite Automata, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 6: 66–92, 1960.
Chomsky, N. Barriers, MIT Press, Cambridge, MA, 1985.
Chomsky, N. The Minimalist Program, MIT Press, Cambridge, MA, 1995.
Courcelle, B. Graph Rewriting: An Algebraic and Logic Approach. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B. Elsevier, Amsterdam, 193–242, 1990.
Courcelle, B. The Monadic Second-Order Logics of Graphs VII: Graphs as Relational Structures, Theoretical Computer Science102: 3–33, 1992.
Courcelle, B. The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation. Vol. I: Foundations. World Scientific, Singapore, Chapt. 5, 313–400, 1997.
Doner, J.E. Tree Acceptors and some of their Applications, Journal of Computer and System Sciences4: 406–451, 1970.
Elgot, C.C. Decision Problems of Finite Automata Design and Related Arithmetics, Transactions of the American Mathematical Society98: 21–51, 1961.
Engelfriet, J. and S. Maneth.Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations, Information and Computation154: 34–91, 1999.
Engelfriet, J. and E.M. Schmidt. IO and OI, Part I, Journal of Computer and System Sciences15: 328–353, 1977.
Engelfriet, J. and E.M. Schmidt. IO and OI, Part II, Journal of Computer and System Sciences16: 67–99, 1978.
Engelfriet, J. and V. van Oostrom. Regular Description of Context-free Graph Languages, Journal of Computer and System Sciences53(3): 556–574, 1996.
Fischer, M.J. Grammars with Macro-like Productions. In Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 131–142, 1968.
Frank, R. and K. Vijay-Shanker. Primitive C-Command, Ms., Johns Hopkins University & Universtiy of Delaware, 1998.
Gécseg, F. and M. Steinby. Tree Automata, Akadémiai Kiadó, Budapest, 1984.
Huybregts, M.A.C. Overlapping Dependencies in Dutch, Utrecht Working Papers in Linguistics1: 24–65, 1976.
Huybregts, M.A.C. TheWeak Adequacy of Context-Free Phrase Structure Grammar, In G.J. de Haan, M. Trommelen, and W. Zonneveld, editors, Van Periferie naar Kern. Foris, Dordrecht, 81–99, 1984.
Immerman, N. Languages that Capture Complexity Classes, SIAM Journal of Computing16(4): 760–778, 1987.
Maibaum, T.S.E. A Generalized Approach to Formal Languages, Journal of Computer and System Sciences88: 409–439, 1974.
Mezei, J. and J. Wright. Algebraic Automata and Context-Free Sets, Information and Control11: 3–29, 1967.
Michaelis, J. Derivational Minimalism is Mildly Context-Sensitive. In M. Moortgat, editor, Logical Aspects of Computational Linguistics '98, Lecture Notes in Artificial Intelligence. Springer, Berlin. To appear.
Michaelis, J., U. Mönnich, and F. Morawietz. Algebraic Descriptions of Derivational Minimalism. In Algebraic Methods in Language Processing: Second AMASTWorkshop on Language Processing, University of Iowa. To appear.
Mönnich, U. On Cloning Context-Freeness. In H.-P. Kolb and U. Mönnich, editors, The Mathematics of Syntactic Structure, No. 44 in Studies in Generative Grammar. Mouton de Gruyter, Berlin, 195–229, 1999.
Peters, P.S. and R.W. Ritchie. On the Generative Power of Transformational Grammars, Information Sciences6: 49–83, 1973.
Pullum, G. and G. Gazdar. Natural Languages and Context-Free Languages, Linguistics and Philosophy4(4): 471–504, 1982.
Rogers, J. A Descriptive Approach to Language-Theoretic Complexity, Studies in Logic, Language and Information. CSLI and FOLLI, 1998.
Rounds, W.C. Tree-Oriented Proofs of some Theorems on Context-Free and Indexed Languages. In Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, 109–116, 1970.
Shieber, S.M. Evidence against the Context-Freeness of Natural Language, Linguistics and Philosophy8(3): 333–344, 1985.
Stabler, E. Derivational Minimalism. In C. Retoré, editor, Logical Aspects of Computational Linguistics.Lecture Notes in Artificial Intelligence 1328. Springer, Berlin, 68–95, 1997.
Thatcher, J.W. and J.B. Wright. Generalized Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic, Mathematical Systems Theory2(1): 57–81, 1968.
Thomas, W. Automata on Infinite Objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Elsevier, Amsterdam, Chapt. 4, 133–191, 1990.
Vijay-Shanker, K. and D.J. Weir. The Equivalence of Four Extensions of Context-Free Grammars, Mathematical Systems Theory27(6): 511–546, 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kolb, HP., Mönnich, U. & Morawietz, F. Descriptions of Cross-Serial Dependencies. Grammars 3, 189–216 (2000). https://doi.org/10.1023/A:1009992722773
Issue Date:
DOI: https://doi.org/10.1023/A:1009992722773