Two-Step approaches to natural language formalism

Two-Step Approaches to Natural Language Formalism

Volumn , Issue , 2008, Pages 1-264

  Morawietz, Frank ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

Computerlinguistik; Syntax; Unifikationsgrammatik

Indexed keywords

EID: 85119501499     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (195)

1. Aho, A. V. 1968 Indexed grammars - an extension to context free grammars. J. ACM 15: 647-671
2. Aho, A. V. and J. D. Ullman. 1971 Translations on a context-free grammar. Information and Control 19:439-475
3. Ayari, A., D. Basin, and A. Podelski. 1998 LISA: A specification language based on WS2S. In: M. Nielsen and W. Thomas (eds.), Computer Science Logic, 11th International Workshop, CSL'97, Annual Conference of the EACSL, Aarhus, Denmark:Springer, LNCS
4. Barton, G. E., Jr. and R. C. Berwick. 1985 Parsing with assertion sets and information monotonicity. In: Proceedings ofIJCAI-85, pp. 769-771
5. Basin, D. and N. Klarlund. 1995 Hardware verification using monadic second-order logic. In: Computer-Aided Verification (CAV '95), Springer, vol. 939 of LNCS,pp. 31-41
6. Basin, D. and N. Klarlund. 1998 Automata based symbolic reasoning in hardware verification. Formal Methods In System Design 13: 255-288, Extended version of: "Hardware verification using monadic second-order logic," CAV '95, LNCS 939
7. Berwick, R. C. and A. Weinberg. 1985 Deterministic parsing: A modern view. In: Proceedings ofNELS 15, Brown University, Providence, RI, pp. 15-33
8. Blackburn, P. and C. Gardent. 1995 A specification language for lexical-functional grammars. Tech. Rep. 51, Computational Linguistics at the University of the Saarland (CLAUS)
9. Blackburn, P., C. Gardent, and W. Meyer-Viol. 1993 Talking about trees. In: Proceedings of the 6th EACL, pp. 21-29
10. Blackburn, P., C. Gardent, and W. Meyer-Viol. 1994 Linguistics, logic, and finite trees. Report CS-R9412, CWI, Amsterdam
11. Bloem, R. and J. Engelfriet. 1997a Characterization of properties and relations defined in Monadic Second Order logic on the nodes of trees. Tech. Rep. 97-03, Dept. of Computer Science, Leiden University
12. Bloem, R. and J. Engelfriet. 1997b Monadic second order logic and node relations on graphs and trees. In: J. Mycielski, G. Rozenberg, and A. Salomaa (eds.), Structures in Logic and Computer Science, Springer-Verlag, vol. 1261 of Lecture Notes in Computer Science, pp. 144-161
13. Brody, M. 1995 Lexico-Logical Form. Cambridge, Ma.: MIT Press
14. Bryant, R. E. 1992 Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys 24(3): 293-318
15. Büchi, J. R. 1960 Weak second-order arithmetic and finite automata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 6: 66-92
16. Carpenter, B. 1992 The Logic of Typed Feature Structures, vol. 32 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press
17. Chidlovskii, B. 2000 Using regular tree automata as XML schémas. In: Proc. IEEE Advances in Digital Libraries Conference
18. Chomsky, N. 1956 Three models for the description of language. I.R.E. Transactions of Information Theory 2: 113-124
19. Chomsky, N. 1957 Syntactic Structures. The Hague: Mouton
20. Chomsky, N. 1959 On certain formal properties of grammars. Information and Control 2(2): 137-167
21. Chomsky, N. 1965 Aspects of the Theory of Syntax. Cambridge, Mass: MIT Press
22. Chomsky, N. 1982 Lectures on Government and Binding. Dordrecht, Holland: Foris Publications
23. Chomsky, N. 1985 Barriers. Cambridge, MA: MIT Press
24. Chomsky, N. 1995 The Minimalist Program, vol. 28 of Current Studies in Linguistics. MIT Press
25. Cornell, T. L. 1992 Description Theory, Licensing Theory, and Principle-Based Grammars and Parsers. Ph.D. thesis, UCLA
26. Cornell, T. L. 1994 On determining the consistency of partial descriptions of trees. In: 32nd Annual Meeting of the ACL: Proceedings of the Conference, Association for Computational Linguistics, Las Cruces, New Mexico, pp. 163-170
27. Cornell, T. L. 1996 Model-theoretic syntax. Glot International 2(1/2)
28. Cornell, T. L. 1998 Island effects in type logical approaches to the minimalist program. In: Proceedings of FHCG-98 Joint Conference On Formal Grammar, Head-Driven Phrase Structure Grammar, and Categorial Grammar, Saarbrücken, Germany
29. Cornell, T. L. 1999a Derivational and representational views of minimalist syntactic calculi. In: A. Lecomte, F. Lamarche, and G. Perrier (eds.), Logical Aspects of Computational Linguistics (LACL '97), Berlin: Springer, no. 1582 inLNALpp. 92-111
30. Cornell, T. L. 1999b Representational minimalism. In: H.-P. Kolb and U. Mönnich (eds.), The Mathematics of Syntactic Structure, Mouton de Gruyter, no. 44 in Studies in Generative Grammar
31. Cornell, T. L. 2000 Parsing and grammar engineering with tree automata. In: Algebraic Methods in Language Processing: Second AMAST Workshop on Language Processing, Parlevink, University of Iowa, TWLT
32. Courcelle, B. 1990 Graph rewriting: An algebraic and logic approach. In: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Elsevier, vol. 1 of Handbook of Theoretical Computer Science, pp. 193-242
33. Courcelle, B. 1997 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, chap. 5, pp. 313-400
34. Damgaard, N., N. Klarlund, and M. I. Schwartzbach. 1999 Yak Yak: Parsing with logical side constraints. In: Proceedings of DLT'99
35. Devienne, P., P. Lebgue, A. Parrain, J. Routier, and J. Wiirtz. 1994 Smallest horn clause programs. Journal of Logic Programming 19,20: 1-41
36. Doner, J. 1970 Tree acceptors and some of their applications. Journal of Computer and System Sciences 4: 406-451
37. Duchier, D. 1999 Axiomatizing dependency parsing using set constraints. In: Proceedings of MOL 6, Orlando, Florida
38. Duchier, D. and S. Thater. 1999 Parsing with tree descriptions: a constraint based approach. In: ProProceedings of NLULP'99
39. Ebbinghaus, H.-D. and J. Flum. 1995 Finite Model Theory. Berlin: Springer
40. Elgaard, J., A. Moller, and M. I. Schwartzbach 2000 Compile-time debugging of C programs working on trees. In: Proceedings of European Symposium on Programming Languages and Systems, Berlin: Springer, vol.1782 of LNCS
41. Elgot, C. C. 1961 Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc. 98: 21-51
42. Engelfriet, J. 1997 Context-free graph grammars. In: G. Rozenberg and A. Salomaa (eds.), Handbook of Formal Languages. Vol. Ill: Beyond Words, Springer, chap. 3, pp. 125-213
43. Engelfriet, J.and S. Maneth 1999 Macro tree transducers, attribute grammars, and MSO definable tree translations. Information and Computation 154: 34-91
44. Engelfriet, J.and S. 2000 Tree languages generated by context-free graph grammars. In: H.-J. K. H. Ehrig, G. Engels and G. Rozenberg (eds.), Proceedings of Theory and Applications of Graph Transformations - TAGT'98, no. 1764 in LNCS,pp. 15-29
45. Engelfriet, J.and S. 2001 Macro tree translations of linear size increase are mso definable. Technical Report 01-08, Leiden Institute of Advanced Computer Science, Leiden University
46. Engelfriet, J. and V. van Oostrom. 1996 Regular description of context-free graph languages. Journal Comp. & Syst. Sci. 53(3): 556-574
47. Engelfriet, J. and E.Schmidt 1977 IO and OI, part I. J. Comput. System Sci. 15: 328-353
48. Engelfriet, J. and E. 1978 IO and OI, part II. J. Comput. System Sci. 16: 67-99
49. Engelfriet, J. and H. Vogler. 1985 Macro tree transducers. Journal of Computer and System Sciences 31(1): 71-146
50. Fagin, R. 1974 Generalized first-order spectra and polynomial-time recognizable sets. In: R. Karp (ed.), Complexity of Computation, AMS, vol. 7 of S1AMAMSProc., pp. 27-41
51. Fischer, M. J. 1968 Grammars with macro-like productions. In: Proceedings of the 9th Annual Symposium on Switching and Automata Theory, IEEE, pp. 131-142
52. Fong, S. 1992 Computational Properties of Principle-Based Grammatical Theories. Ph.D. thesis, MIT
53. Frank, R. 1990 Computation and Linguistic Theory: A Government Binding Theory Parser using Tree Adjoining Grammar. Master's thesis, University of Pennsylvania
54. Frank, R. and K. Vijay-Shanker. 1995 C-command and grammatical primitives. Presentation at the 18th GLOW Colloquium, University of Troms0
55. Frank, R. and K. Vijay-Shanker. 1998 Primitive c-command. Ms., Johns Hopkins University & Universtiy of Delaware
56. Fujiyoshi and Kasai. 2000 Spinal-formed context-free tree grammars. MST: Mathematical Systems Theory 33
57. Gaifman, H. 1965 Dependency systems and phrase-structure systems. Information and Control 8(3): 304-337
58. Gazdar, G. 1988 Applicability of indexed grammars to natural languages. In: U. Reyle and C. Rohrer (eds.), Natural Language Parsing and Linguistic Theories, Dordrecht: D. Reidel, pp. 69-94
59. Gazdar, G., E. Klein, G. K. Pullum, and I. A. Sag. 1985 Generalized Phrase Structure Grammar. Cambridge, Massachusetts: Harvard University Press
60. Gécseg, F. and M. Steinby. 1984 Tree Automata. Budapest: Akadémiai Kiadó
61. Gécseg, F. and M. Steinby. 1997 Tree languages. In: G. Rozenberg and A. Salomaa (eds.), Handbook of Formal Languages: Beyond Words, Berlin: Springer, vol. 3
62. Hanschke, P. and J. Wiirtz. 1993 Satisfiability of the smallest binary program. Information Processing Letters 45(5): 237-241
63. Harkema, H. 2000 A recognizer for minimalist grammars. In: Sixth International Workshop on Parsing Technologies, IWPT'2000
64. Hays, D. G. 1964 Dependency theory: A formalism and some observations. Language 40(4): 511-525, prepared for US Air Force Project Rand
65. Höhfeld, M. and G. Smolka. 1988 Definite relations over constraint languages. LILOG Report 53, IBM Deutschland, Stuttgart, Germany
66. Huybregts, M. A. C. 1976 Overlapping dependencies in Dutch. Utrecht Working Papers in Linguistics 1: 24-65
67. Huybregts, M. A. C. 1984 The weak adequacy of context-free phrase structure grammar. In: G. J. de Haan, M. Trommelen, and W. Zonneveld (eds.), Van periferie naarkern, Dordrecht: Foris, pp. 81-99
68. Immerman, N. 1987 Languages that capture complexity classes. SIAM J. of Computing 16(4): 760-778
69. Janssen, T. M. 2000 An algebraic approach to grammatical theories for natural language. In: A. Nijholt, G. Scollo, T. Rus, and D. Heylen (eds.), Algebraic Methods in Language Processing, AMiLP 2000, University of Iowa
70. Jensen, J. L., M. E. Joergensen, N. Klarlund, and M. I. Schwartzbach. 1997 Automatic verification of pointer programs using monadic secondorder logic. In: PLDI '97
71. Johnson, D. and P. Postal. 1980 Arc Pair Grammar. Princeton, NJ: Princeton University Press
72. Johnson, M. 1988 A Logic of Attribute-Value Structures and the Theory of Grammar. Stanford/Chicago: CSLI/Chicago University Press Johnson, M. 1990 Expressing disjunctive and negative feature constraints with classical first-order logic. In: Proceedings of the 28th Meeting of the Association for Computational Linguistics, Association for Computational Linguistics, Association for Computational Linguistics
73. Johnson, M. 1990 Expressing disjunctive and negative feature constraints with classical first-order logic. In: Proceedings of the 28th Meeting of the Association for Computational Linguistics, Association for Computational Linguistics, Association for Computational Linguistics
74. Johnson, M. 1991 Features and formulae. Computational Linguistics 17(2): 131-151.
75. Joshi, A. K. 1985 Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural description. In: D. Dowty, L. Karttunen, and A. Zwicky (eds.), Natural Language Parsing, Cambridge, UK: Cambridge University Press, pp. 206-250
76. Joshi, A. K. 1987 An introduction to tree adjoining grammars. In: Manaster-Ramer (ed.), Mathematics of Language, Amsterdam: John Benjamins
77. Joshi, A. K., L. S. Levy, and M. Takahashi. 1975 Tree adjunct grammars. Journal of Computer and System Sciences 10: 136-63
78. Joshi, A. K. and Y. Schabes. 1997 Tree adjoining grammars. In: G. Rozenberg and A. Salomaa (eds.), Handbook of Formal Languages, Berlin: Springer, vol. 3: Beyond Words of Handbook of Formal Languages, pp. 69-123
79. Kallmeyer, L. 1999 Underspecification in tree description grammar. In: H.-P. Kolb and U. Mönnich (eds.), The Mathematics of Syntactic Structure: Trees and their Logics, Mouton de Gruyter, no. 44 in Studies in Generative Grammar
80. Kaplan, R. M. and J. Bresnan. 1983 Lexical-functional grammar: A formal system for grammatical representation. In: J. Bresnan (ed.), The Mental Representation of Grammatical Relations, Cambridge, Mass: MIT Press, pp. 173-381
81. Kasper, R. T. 1987a Feature Structures: A Logical Theory with Application to Language Analysis. Ph.D. thesis, University of Michigan
82. Kasper, R. T. 1987b A unification method for disjunctive feature descriptions. In: ACL Proceedings, 25th Annual Meeting, Stanford, CA, pp. 235-242
83. Kasper, R. T. and W. C. Rounds. 1986 A logical semantics for feature structures. In: ACL Proceedings, 24th Annual Meeting, Columbia University, New York, NY, pp. 257-271
84. Kay, M. 1983 Unification grammar. Tech. rep., Xerox Palo Alto Research Center, Palo Alto,CA
85. Kay, M. 1984 Functional unification grammar: a formalism for machine translation. COLING-84 pp. 75-78
86. Kayne, R. S. 1994 The Antisymmetry of Syntax, vol. 25 of Linguistic Inquiry Monographs. Cambridge, Mass. and London, England: MIT Press
87. Keenan, E. L. and E. P. Stabler. 1996 Abstract syntax. In: A.-M. DiSciullo (ed.), Configurations: Essays on Structure and Interpretation, Somerville, Massachusetts: Cascadilla Press, pp. 329-344
88. Keenan, E. L. and E. P. 1997 Syntactic invariants. In: 6th Annual Conference on Language, Logic and Computation, Stanford
89. Kelb, P., T. Margaría, M. Mendier, and C. Gsottberger. 1997 MOSEL: A flexible toolset for monadic second-order logic. In: E. Brinksma (ed.), Tools and Algorithms for The Construction and Analysis of Systems: International Workshop, TACAS '97, Lecture Notes in Computer Science 1019, Springer, pp. 183-202
90. King, P. J. 1989 A Logical Formalism for Head-Driven Phrase Structure Grammar. Ph.D. thesis, Manchester University, Manchester, England
91. King, P. J. 1994a An expanded logical formalism for head-driven phrase stucture grammar. Arbeitspapiere des SFB 340 59, SFB 340, Universität Tübingen
92. King, P. J. 1994b Typed feature structures as descriptions. In COLING-94
93. Klarlund, N. 1998 MONA & Fido: The logic-automaton connection in practice. In: M. Nielsen and W. Thomas (eds.), Computer Science Logic, 11th International Workshop, CSL'97, Annual Conference of the EACSL Aarhus, Denmark: Springer, LNCS
94. Klarlund, N. and A. Moller. 1998 MONA Version 1.2 User Manual. BRICS Notes Series NS-98-3, Department of Computer Science, University of Aarhus
95. Klarlund, N., A. Moller, and M. I. Schwartzbach. 2000 MONA implementation secrets Proceedings of CIAA 2000
96. Klarlund, N. and M. I. Schwartzbach. 1993 Graph types. In: Conference Record of the Twentieth ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, Charleston, South Carolina: ACM Press, pp. 196-205
97. Klarlund, N. and M. I. Schwartzbach. 1997 A domain-specific language for regular sets of strings and trees. In: Proceedings of the Conference on Domain-Specific Languages, USENIX, Santa Barbara, Ca.
98. Kleene, S. C. 1956 Representation of events in nerve nets and finite automata. In: C. Shannon and J. McCarthy (eds.), Automata Studies, Princeton University Press
99. Kolb, H.-P., J. Michaelis, U. Mönnich, and F. Morawietz. 2003 An operational and denotational approach to non-context-freeness. Theoretical Computer Science 293: 261-289
100. Kolb, H.-P., U. Mönnich, and F. Morawietz Kolb, H.-P., U. Mönnich, and F. Morawietz. 1999a Logical description of cross-serial dependencies. In: Proceedings of the Workshop Finite Model Theory and its Applications at FloC '99, Trento, Italy
101. Kolb, H.-P., U. Mönnich, and F. Morawietz Kolb, H.-P., U. Mönnich, and F. Morawiet. 1999b Regular description of cross-serial dependencies. In: Proceedings of MOL 6, Orlando, Florida
102. Kolb, H.-P., U. Mönnich, and F. Morawietz. 2000 Descriptions of cross-serial dependencies. Grammars 3(2/3): 189-216
103. Kolb, H.-P. and C. L. Thiersch. 1991 Levels and empty categories in a principles and parameter approach to parsing. In: H. Haider and K. Netter (eds.), Reptresentation and Derivation in the Theory of Grammar, Dordrecht: Kluwer
104. Kracht, M. 1993 Mathematical aspects of command relations. In: Sixth Conference of the European Chapter of the Association for Computational Linguistics, EACL, pp. 240-249
105. Kracht, M. 1995 Syntactic codes and grammar refinement. Journal of Logic, Language and Information 4: 41-60
106. Kracht, M. 1999 Adjunction structures and syntactic domains. In: H.-P. Kolb and U. Mönnich (eds.), The Mathematics of Syntactic Structure: Trees and their Logics, Mouton de Gruyter, no. 44 in Studies in Generative Grammar
107. Kunze, J. 1977 Dependency grammar as syntactic model in several procedures of automatic sentence analysis. Linguistics 195: 46-62
108. Lambek, J. 1958 The mathematics of sentence structure. American Mathematical Monthly 65: 154-169
109. Lang, b. 1992 Recognition can be harder than parsing. In: Proc. of the 2nd Int. Workshop on Tree Adjoining Grammars. Philadelphia, PA, June 1992
110. Lautemann, C, T. Schwentick, and D. Thérien 1995 Logics for context-free languages. In: L. Pacholski and J. Tiuryn (eds.), Computer Science Logic '94, Springer, pp. 205-216, LNCS 933
111. Lawvere, F. W. 1963 Functorial Semantics of Algebraic Theories. Ph.D. thesis, Columbia University, Braunschweig
112. Lecomte, A. 1997 POM-nets and minimalism. In: C. Casadio (ed.), Proceedings of the IV Roma Workshop: Dynamic Perspectives in Logic and Linguistics, Università di Roma Tre
113. Lecomte, A. 1998 Categorial minimalism. In: Proceedings of LACL'98, Grenoble, France
114. Levy, J. 1996 Linear second-order unification. In: H. Ganzinger (ed.), Proceedings of the 7th International Conference on Rewriting Techniques and Applications (RTA-96), Berlin: Springer-Verlag, vol. 1103 of LNCS, pp. 332-346
115. Lewis, H. R. and C. H. Papadimitriou 1998 Elements of the Theory of Computation. Upper Saddle River, New Jersey: Prentice-Hall, Inc.
116. Lloyd, J. 1984 Foundations of Logic Programming. Berlin: Springer
117. Macias, B. 1990 An Incremental Parser for Government-Binding Theory. Ph.D. thesis, University of Cambridge
118. Maibaum, T. S. E. 1974 A generalized approach to formal languages. J. Comput. System Sci. 88: 409-439
119. Marcus, M. P., D. Hindle, and M. M. Fleck 1983 D-theory: Talking about talking about trees. In: 21st Annual Meeting of the ACL: Proceedings of the Conference, pp. 129-136
120. McCawley, J. D. 1986 Encyclopedic Dictionary of Semiotics, Mouton de Gruyter, chap. Syntax, pp.1061-71
121. Mezei, J. and J. B. Wright 1967 Algebraic automata and contextfree sets. Information and Control 11: 3-29
122. Michaelis, J. 1999 Derivational minimalism is mildly context-sensitive. Linguistics in Potsdam (LiP) 5, Institut für Linguistik, Universität PoPotsdam, Available under http://www.ling.uni-potsdam.de/~michael/
123. Michaelis, J. 2001a Derivational minimalism is mildly context-sensitive. In: M. Moortgat (ed.), LACL '98, Berlin: Springer, vol. 2014 of LNAI
124. Michaelis, J. 2001b On Formal Properties of Minimalist Grammars. Ph.D. thesis, University of Potsdam
125. Michaelis, J. and M. Kracht 1997 Semilinearity as a syntactic invariant. In: C. Retore (ed.), Proceedings of the 1st International Conference on Logical Aspects of Computational Linguistics (LACL-96), Berlin: Springer, vol. 1328 of LNAI, pp. 329-345
126. Michaelis, J., U. Mönnich, and F. Morawietz 2000a Algebraic descriptions of derivational minimalism. In: Algebraic Methods in Language Processing: Second AMAST Workshop on Language Processing, Parlevink, University of Iowa, TWLT
127. Michaelis, J., U. Mönnich, and F. Morawietz 2000b Derivational minimalism in two regular and logical steps. In: Proceedings of the Tag+5 Conference, Paris
128. Michaelis, J., U. Mönnich, and F. Morawietz 2001 On minimalist attribute grammars and macro tree transducers. In: C. Rohrer, A. Rossdeutscher, and H. Kamp (eds.), Linguistic Form and its Computation, CSLI Publications, pp. 287-326
129. Moller, A. and M. Schwartzbach 2001 The pointer assertion logic engine. In: C. Norris and J. J. B. Fenwick (eds.), Proceedings of the ACM SIGPLAN '01 Conference on Programming Language Design and Implementation (PLDI-01 ), N.Y.: ACMPress, vol. 36.5 of ACM SIGPLAN Notices, pp. 221-231
130. Mönnich, U. 1993 Algebraic refinement of the Chomsky hierarchy. Course notes, 5th European Summer School in Logic, Language and Information, Lisbon
131. Mönnich, U. 1997a Adjunction as substitution. In: G.-J. M. Kruijff, G. Morill, and R. Oehrle (eds.), Formal Grammar '97, Aix-en-Provence, pp. 169- 178
132. Mönnich, U. 1997b Lexikalisch kontrollierte Kreuzabhängigkeiten und Kongruenzmorphologien. Talk at Meeting of the SFBs 471, 340 and 282, Available under http://tcl.sfs.uni-tuebingen.de/~tcl/uwe/uwejnoennich.html
133. Mönnich, U. 1998 TAGs M-constructed. In: TAG+ 4th Workshop, Philadelphia
134. Mönnich, U. 1999 On cloning contextfreeness. In: H.-P. Kolb and U. Mönnich (eds.), The Mathematics of Syntactic Structure, Mouton de Gruyter, no. 44 in Studies in Generative Grammar, pp. 195-229
135. Morawietz, F. 1999 Monadic second order logic, tree automata and constraint logic programming. In: H.-P. Kolb and U. Mönnich (eds.), The Mathematics of Syntactic Structure, Mouton de Gruyter, no. 44 in Studies in Generative Grammar
136. Morawietz, F. 2000a Chart parsing and constraint programming. In: Proceedings of COLING-2000
137. Morawietz, F. 2000b Chart parsing as constraint propagation. In: F. Morawietz (ed.), Some Aspects of Natural Language Processing and Constraint Programming, Universität Tübingen, no. 150 in Arbeitspapiere des SFB 340, pp. 29-50
138. Morawietz, F. and T. L. Cornell 1997a Approximating Principles and Parameters Grammars with MSO Tree Logics. In: Proceedings ofLACL '97, Nancy, France
139. Morawietz, F. and T. L. Cornell 1997b On the recognizability of relations over a tree definable in a monadic second order tree description language. Arbeitspapiere des SFB 340 85, SFB 340, Universität Tübingen
140. Morawietz, F. and T. L. Cornell 1997c Representing constraints with automata. In: Proceedings of the 35th Annual Meeting of the ACL and the 8th Conference of the EACL, Madrid, Spain: Association for Computational Linguistics, pp. 468- 475
141. Morawietz, F. and T. L. Cornell 1999 The Logic-Automaton Connection in Linguistics. In: Proceedings of LACL1997, Springer, no. 1582 in LNAI
142. Morawietz, F. and T. L. Cornell 2001 A model-theoretic description of tree adjoining grammars. Electronic Notes in Theoretical Computer Science 53 (53), Formal Grammar/ MOL Conference 2001. Elsevier Science
143. Moschovakis, Y. N. 1974 Elementary Induction on Abstract Structures. Amsterdam: North- Holland
144. Moshier, M. A. 1988 Extensions to Unification Grammar for the Description of Programming Languages. Ph.D. thesis, University of Michigan
145. Moshier, M. A. 1993 On completeness theorems for feature logics. CLAUS Report 31, Universität des Saarlandes,Saarbrücken, Germany
146. Moshier, M. A. and W. C. Rounds 1987 A logic for partially specified data structures. In: ACM (ed.), POPL '87. Fourteenth Annual ACM SIGACT-SIGPLAN Symposium on Principles of programming languages, January 21-23, 1987, Munich, W. Germany, New York, NY, USA: ACM Press, pp. 156-167
147. Neven, F. 1999 Design and Analysis of Query Languages for Structured Documents - A Formal and Logical Approach. Ph.D. thesis, Limburgs Universitair Centrum
148. Neven, F. and T. Schwentick 1999 Query automata. In: ACM (ed.), Proceedings of the Eighteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems: PODS 1999: Philadelphia, Pennsylvania, May 31-June 2, 1999, New York, NY 10036, USA: ACM Press, pp. 205-214
149. Neven, F. and T. Schwentick 2000 Expressive and efficient pattern languages for tree-structured data. In: Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, ACM, pp. 145-156
150. Neven, F. and T. Schwentick 2002 Automata- and logic-based pattern languages for tree-structured data. Manuscript, URL: http://alpha.luc.ac.be/~lucg5503/publs.html
151. Niehren, J. and A. Podelski 1992 Feature automata and recognizable sets of feature trees. In: M.-C. Gaudel and J.-P. Jouannaud (eds.), Proceedings of the 4th International Joint Conference on Theory and Practice of Software Development, Orsay, France: Springer, no. 668 in LNCS, pp. 356-375
152. Parikh, R. 1966 On context-free languages. Journal of the ACM 13: 570-581.
153. Peacock, G. 1830 A Treatise on Algebra. Cambridge
154. Pereira, F. C. N. and M. D. Riley 1997 Speech recognition by composition of weighted finite automata. In: Roche and Schabes (1997)
155. Peters, P. S. and R. W. Ritchie 1971 On restricting the base component of transformational grammars. Information and Control 18(5): 483-501
156. Peters, P. S. and R. W. Ritchie 1973 On the generative power of transformational grammars. Information Sciences 6: 49-83
157. Pollard, C. J. 1984 Generalized Context-Free Grammars, Head Grammars and Natural Language. Ph.D. thesis, Stanford University
158. Pollard, C. J. and I. A. Sag 1987 Information-Based Syntax and Semantics, vol. 13 of CSLI Lecture Notes. CSLI Publications
159. Pollard, C. J. and I. A. Sag 1994 Head-Driven Phrase Structure Grammar. University of Chicago Press and CSLI Publications
160. Post, E. 1946 A variant of a recursively unsolvable problem. Bulletin of the American Mathematical Society 52: 264-268
161. Pullum, G. and G. Gazdar 1982 Natural languages and context-free languages. Linguistics and Philosophy 4(4): 471-504
162. Rabin, M. O. 1969 Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society 141: 1-35
163. Rabin, M. O. and D. Scott 1959 Finite automata and their decision problems. IBM Journal of Research and Development 3: 114-125
164. Rambow, O. and G. Satta 1999 Independent parallelism in finite copying parallel rewriting systems. Theoretical Computer Science 223(1-2): 87-120
165. Rambow, O., K. Vijay-Shanker, and D. Weir 1995 D-Tree Grammars. In: Proceedings of ACL Rizzi, L. 1990 Relativized Minimality. MIT Press
166. Roche, E. and Y. Schabes (eds.) 1997 Finite-State Language Processing. Language, Speech, and Communication Series, MIT Press
167. Rogers, J. 1994 Studies in the Logic of Trees with Applications to Grammar Formalisms. Ph.D. thesis, University of Delaware, Dep. of Computer & Information Sciences, Newark, DE 19716, Published as Technical Report No. 95-04
168. Rogers, J. 1996 A model-theoretic framework for theories of syntax. In: Proc. of the 34 th Annual Meeting of the ACL, Santa Cruz, USA
169. Rogers, J. 1997 On descriptive complexity, language complexity, and GB. In: P. Blackburn and M. de Rijke (eds.), Specifying Syntactic Structures, CSLI Publications
170. Rogers, J. 1998 A Descriptive Approach to Language-Theoretic Complexity. Studies in Logic, Language, and Information, CSLI Publications and FoLLI
171. Rounds, W. C. 1970a Mappings and grammars on trees. Mathematical Systems Theory 4: 257-287
172. Rounds, W. C. 1970b Tree-oriented proofs of some theorems on context-free and indexed languages. In: Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, pp. 109-116
173. Sandholm, A. and M. I. Schwartzbach 1998 Distributed safety controllers for web services. In: E. Astesiano (ed.), Fundamental Approaches to Software Engineering, FASE'98, LNCS 1382, Springer-Verlag, no. 1382 in Lecture Notes in Computer Science, pp. 270-284, Also available as BRICS Technical Report RS-97-47
174. Seki, H., T. Matsumura, M. Fujii, and T. Kasami 1991 On multiple context-free grammars. Theoretical Computer Science 88(2): 191-229
175. Shieber, S. M. 1985 Evidence against the context-freeness of natural language. Linguistics and Philosophy 8: 333-343
176. Stabler, E. P. 1992 The Logical Approach to Syntax: Foundations, Specifications and Implementations of Theories of Government and Binding. Cambridge, Ma.: MIT Press
177. Stabler, E. P. 1994 The finite connectivity of linguistic structure. In: C. C. Jr., L. Frazier, and K. Rayner (eds.), Perspectives on Sentence Processing, Hillsdale, New Jersey: Lawrence Erlbaum, pp. 303-336
178. Stabler, E. P. 1997 Derivational minimalism. In: C. Retoré (ed.), Logical Aspects of Computational Linguistics, Berlin: Springer, pp. 68-95, LNAI 1328
179. Stabler, E. P. 1999a Performance models for a derivational minimalism. Presented at the Workshop Linguistic Form and its Computation of the SFB 340 in Bad Teinach, Draft
180. Stabler, E. P. 1999b Remnant movement and complexity. In: G. Bouma, G.-J. M. Kruijff, E. Hinrichs, and R. T. Oehrle (eds.), Constraints and Resources in Natural Language Syntax and Semantics, CSLI, vol. II of Studies in Constrained Based Lexicalism, pp. 299-326
181. Stabler, E. P. and E. L. Keenan 2000 Structural similarity. In: A. Nijholt, G. Scollo, T. Rus, and D. Heylen (eds.), Algebraic Methods in Language Processing, AMiLP 2000, University of Iowa
182. Steedman, M. 1988 Combinators and grammar. In: R. Oehrle, E. Bach, and D. Wheeler (eds.), Categorial Grammar and Natural Language Structures, Dordrecht: Reidel, pp. 417-442
183. Thatcher, J. W. 1970 Generalized sequential machines. J. Comput. System Sci. 4: 339-367
184. Thatcher, J. W. and J. B. Wright 1968 Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory 2(1): 57-81
185. Thomas, W. 1990 Automata on infinite objects. In: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Elsevier Science Publishers?. V., chap. 4, pp. 133-191
186. Thomas, W. 1997 Languages, automata, and logic. In: G. Rozenberg and A. Salomaa (eds.), Handbook of Formal Languages, Berlin: Springer, vol. 3: Beyond Words, pp. 389-455
187. Veenstra, M. 1998 Formalizing the Minimalist Program. Ph.D. thesis, University of Groningen
188. Vijay-Shanker, K., D. Weir, and O. Rambow 1995 Parsing d-tree grammars. In: Proceedings of the International Workshop on Parsing Technologies, ACL/SIGPARSE, Prag, pp. 252-259
189. Vijay-Shanker, K. and D. J. Weir 1994 The equivalence of four extensions of context-free grammars. Mathematical Systems Theory 27(6): 511-546
190. van Vugt, N. 1996 Generalized Context-Free Grammars. Ph.D. thesis, Leiden University, Leiden, The Netherlands
191. Wagner, E. G. 1994 Algebraic semantics. In: S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum (eds.), Semantic Structures, Oxford University Press, vol. 3 of Handbook of Logic in Computer Science, pp. 323-393
192. Weinberg, A. 1988 Locality Principles in Syntax and in Parsing. Ph.D. thesis, MIT
193. Weir, D. J. 1992 Linear context-free rewriting systems and deterministic tree-walk transducers. In: 30th Meeting of the Association for Computational Linguistics (ACL'92)
194. Whitehead, A. N. 1911 An Introduction to Mathematics. London: Williams and Northgate, Reprinted by Oxford University Press
195. Yu, S. 1997 Regular languages. In: G. Rozenberg and A. Salomaa (eds.), Handbook of Formal Languages: Word, Language, Grammar, Berlin: Springer, vol. 1