References

Abeille,Owen,1998

Anne Abeille, Rambow Owen. Tree Adjoining Grammars: mathematical, computational, and linguistic properties. CLSI, 1998

Abraham,1965

L. Abraham. Some questions of phrase-structure grammars. Comput. Linguistics, Vol. 4, pages 61-70, 1965

Aho,Ullman,1972

Alfred V. Aho, Jeffrey D. Ullman. The Theory of Parsing, Translation, and Compiling, Volume 1: Parsing. Englewood Cliffs, N.J., Prentice-Hall, 1972

Alt,1997

Martin Alt. On Parallel Compilation. Dissertation, Pirrot Verlag & Druck, Saarbrücken, 1997

Arbib,Kfoury,Moll,1981

Michael A. Arbib, A.J. Kfoury, Robert N. Moll. A Basis for Theoretical Computer Science. Springer New York Inc., 1981

Autebert,Berstel,Boasson,1997

Jean-Michel Autebert, Jean Berstel, Luc Boasson. Context-Free Languages and Pushdown Automata. Handbook of Formal Languages, Vol. 1, G. Rozenberg, A. Salomaa Eds., Springer Berlin, 1997

Becker,1994

Tilman Becker. HyTAG: A New Type of TAGs for Hybrid Syntactic Representation of Free Word Order Languages. PhD thesis, University of Saarland, 1994

Becker,1998

Tilman Becker. Automaton Models for Mildly Context-sensitive Formalism. In Proceedings of the MFCS'98 Workshop on Mathematical Linguistics, Manfred Kudlek Ed., (also available as Report FBI-HH-B-213/98, University of Hamburg) Brno, Czech Republic, August 1998

Becker,Heckmann,1998

Tilman Becker, Dominik Heckmann. Recursive Matrix Systems (RMS) and TAG. In Proceedings of TAG+ Workshop, Philadelphia, August 1998

Becker,Heckmann,2000

Tilman Becker, Dominik Heckmann. Efficient Parsing of mildly context-sensitive RMS. Accepted to International Workshop of Parsing Technologies, IWPT2000, Trento, Italy, Februrary 2000

Berstel,1979

Jean Berstel. Transductions and Context-Free Languages. Teubner Studienbücher Stuttgart, Germany, 1979

Boullier,1999

Pierre Boullier. Chinese Numbers, MIX, Scrambling and Range Concatenation Grammars. Institut national de recherche en informatique et en automatique, Research Report No. 3614 at http://www.inria.fr/RRRT/RR-3614.html, INRIA-Rocquencourt, France, January 1999

Boullier,1999

Pierre Boullier. On TAG and Multicomponent TAG Parsing. Institut national de recherche en informatique et en automatique, Research Report No. 3668 at http://www.inria.fr/RRRT/RR-3668.html, INRIA-Rocquencourt, France, Avril 1999

Bratko,1990

Ivan Bratko. Prolog, Programming for Artificial Intelligence. Second edition, Addison Wesley, 1990

Bresnan,Kaplan,Peters,Zaenen,1987

Joan Bresnan, Ronald M. Kaplan, Stanley Peters, Annie Zaenen. Cross-Serial Dependencies in Dutch. In [Savitch,Bach et al,1987], 1987

Chomsky,1959

Noam Chomsky. On certain formal properties of grammars. Information and Control, Vol. 1, pages 91-112, 1959

Christ,1998

Oliver Christ. Parsing as Deduction. Handout, University of Magdeburg, 1998

Culik,Kari,1997

Karel Culik II, Jarkko Kari. Digital Images and Formal Languages. Handbook of Formal Languages, Vol. 3, G. Rozenberg, A. Salomaa Eds., Springer Berlin, 1997

Dassow,Paun,1989

Jürgen Dassow, Gheorghe Paun. Regulated rewriting in formal language theory. EATCS monographs on theoretical Computer Science, Vol. 18, Springer Berlin, 1989

Dassow,Paun,Rozenberg,1997

Jürgen Dassow, Gheorghe Paun, Grzegorz Rozenberg. Grammar Systems. Handbook of Formal Languages, Vol. 2, G. Rozenberg, A. Salomaa Eds. Springer Berlin, 1997

Dassow,Paun,Salomaa,1997

Jürgen Dassow, Gheorghe Paun, Arto Salomaa. Grammars with Controlled Derivations. Handbook of Formal Languages, Vol. 2, G. Rozenberg, A. Salomaa Eds., Springer Berlin, 1997

Earley,1970

Jay Earley. An Efficient Context-Free Parsing Algorithm. Communications of the ACM, Vol. 13, No. 2, February, 1970

Estenfeld,1976

Klaus Estenfeld. Ein funktorieller Zusammenhang zwischen einer beliebigen kontextfreien Sprache und der Greibachsprache. Diploma thesis, University of Saarland, 1976

Fitting,1996

Melvin Fitting. First-order logic and automated theorem proving. Second edition, Graduate texts in computer science, Springer New York, 1996

Gazdar,Pullum,1985

Gerald Gazdar, Geoffrey K. Pullum. Computationally Relevant Properties of Natural Languages and their Grammars. New Generation Computing, Vol. 3, pages 273-306, Ohmsha LTD, 1985

Giammarresi,Restivo,1997

Dora Giammarresi, Antonio Restivo. Two-Dimensional Languages. Handbook of Formal Languages, Vol. 3, G. Rozenberg, A. Salomaa Eds., Springer Berlin, 1997

Ginsburg,1966

Seymour Ginsburg. The Mathematical Theory of Context-Free Languages. McGraw-Hill Book Company, 1966

Ginsburg,1975

Seymour Ginsburg. Algebraic and Automata-theoretic properties of Formal Languages. North-Holland & American Elsevier Publishing Company, 1975

Guan,1992

Yonggang Guan. Klammergrammatiken, Netzgrammatiken und Interpretationen von Netzen. PhD thesis, University of Saarland, 1992

Harrison,1978

Michael A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, 1978

Heckmann,1998

Dominik Heckmann. Recursive Matrix Systems. In Proceedings of the Student Session at the 11th European Summerschool on Logic, Language and Information (ESSLLI98), Saarbrücken, Germany, August 1998

Hopcraft,Ullman,1979

John E. Hopcroft, Jeffrey D. Ullman. Introduction to automata theory, languages and computation. Addison-Wesley, 1979

Hotz,1967

Günter Hotz. Erzeugung formaler Sprachen durch gekoppelte Ersetzungen. Colloquium about automata theory, F. L. Bauer, K. Samelsom, math. institute TU Munich, Germany, pages 62-73, 1967

Hotz,Walter,1968

Günter Hotz, Hermann Walter. Automatentheorie und Formale Sprachen, I. Turingmaschinen und Rekursive Funktionen. Bibliographisches Institut, Mannheim, B.I.-Wissenschaftsverlag, 1968

Hotz,Walter,1969

Günter Hotz, Hermann Walter. Automatentheorie und Formale Sprachen, II. Endliche Automaten. Bibliographisches Institut, Mannheim, B.I.-Wissenschaftsverlag, 1969

Hotz,Claus,1971

Günter Hotz, Volker Claus. Automatentheorie und Formale Sprachen, III. Formale Sprachen. Bibliographisches Institut, Mannheim, B.I.-Wissenschaftsverlag, 1971

Hotz,1978

Günter Hotz. Normal form transformations of context-free grammars. Acta Cybernetica, Vol. 4 (1), pages 65-84, 1978

Hotz,Estenfeld,1981

Günter Hotz, Klaus Estenfeld. Formale Sprachen: Eine automatentheoretische Einführung. B.I.-Wissenschaftsverlag, 1981

Hotz,Pitsch,1994

Günter Hotz, Gisela Pitsch. Fast Uniform Analysis of Coupled-Context-Free Languages. In Proceedings of 21st International Colloquium, ICALP94, Lecture Notes in Computer Science 820, Serge Abiteboul, Eli Shamir Eds., pages 412-423, July 1994

Joshi,Levy,Takahashi,1975

Aravind K. Joshi, L. S. Levy, M. Takahashi. Tree Adjunct Grammars. Journal of Comput. Syst. Sci., Vol. 10-1, 1975

Joshi,1985

Aravind K. Joshi. Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions? D. Dowty, L. Karttuhen, A. Zwicky, Eds., Natural Language Parsing, pages 206 - 250, Cambridge University Press, 1985

Joshi,Vijay-Shanker,Weir,1991

Aravind K. Joshi, K. Vijay-Shanker, David Weir, The Convergence of Mildly Context-Sensitive Grammar Formalisms. Peter Sells, Stuart M. Shieber, Thomas Wasow Eds., Foundational issues in natural language processing, pages 31 -82, Massachusetts Institute of Technology, 1991

Kopka,1992

Helmut Kopka. LaTeX : Eine Einführung. 4. Auflage, Addison-Wesley Publishing Company, 1992

Lamport,1994

Leslie Lamport. LaTeX : a document preparation system. Second edition, Addison-Wesley Publishing Company, 1994

Lewis,Papadimitriou,1981

Harry R. Lewis. Christos H. Papadimitriou, Elements of the Theory of Computation. Prentice-Hall International, 1981

Nakanishi,Takada,Seki,1998

Ryuichi Nakanishi, Keita Takada, Hiroyuki Seki. An Efficient Recognition Algorithm for Multiple Context-Free Languages. IEICE Technical Report, seki@is.aist-nara.ac.jp, 1998

Nederhof,1997a

Mark-Jan Nederhof. Solving the correct-prefix property for TAGs. In Proceedings of MOL5, Saarbrücken, Germany, 1997

Nederhof,1997b

Mark-Jan Nederhof. Regular Approximations of CFLs: A Grammatical View. Talk at DFKI, Saarbrücken, Germany, 1997

Manaster-Ramer,1994

A. Manaster Ramer. Uses and misuses of mathematics in linguistics. In Proceedings of the Xth Congress on Natural and Formal Languages, Sevilla, 1994

Mateescu,Salomaa,1997

Alexandru Mateescu, Arto Salomaa. Aspects of Classical Language Theory. Handbook of Formal Languages, Vol. 1, G. Rozenberg, A. Salomaa Eds., Springer Berlin, 1997

Partee,Meulen,Wall,1990

Barbara H. Partee, Alice ter Meulen, Robert E. Wall. Mathematical Methods in Linguistics. Kluwer Academic Publishers, 1990

Pereira,Warren,1983

Fernando C.N. Pereira, D.H.D. Warren. Parsing as Deduction. In Proceedings of the 21st Annual Meeting of the ACL, Massachusetts Institute of Technology, pages 137-144, Cambridge, Massachusetts, 1983

Pitsch,1990

Gisela Pitsch. Effiziente parallele Verfahren zur Entscheidung des Wortproblems bei Dycksprachen. Master's thesis, University of Saarland, 1990

Pitsch,1993

Gisela Pitsch. Analyse von Klammergrammatiken. PhD thesis, University of Saarland, 1993

Pullum,Gazdar,1982

Geoffrey K. Pullum, Gerald Gazdar. Natural languages and context-free languages. Linguistics and Philosophy, Vol. 4, pages 471-504, 1982

Radzinski,1991

Daniel Radzinski. Chinese Number-Names, Tree Adjoining Languages, and Mild Context-Sensitivity. Association for Computational Linguistics, 1991

Reichert,1991

Armin Reichert. Baumgrammatiken mit Multilinearer Interpretation. Diploma thesis, University of Saarland, 1991

Ritchie,Mellish,Holt,1996

Graeme Ritchie, Chris Mellish, Alexander Holt. Techniques in Natural Language Processing 1: Course Notes. AI Department, University of Edinburgh, 1996

Russel,Norvig,1995

Stuart Russel, Peter Norvig. Artificial Intelligence: A modern Approach. Prentice Hall International Editions, 1995

Satta,Schuler,1998

Giorgio Satta, William Schuler. Restrictions on Tree Adjoining Languages. COLING-ACL '98, In Proceedings of the 17th International Conference on Computational Linguistics, Vol. 2, pages 1176-1182, Canada, 1998

Savitch,Bach et al,1987

Walter J. Savitch, Emmon Bach et al. The Formal Complexity of Natural Language. Studies in Linguistics and Philosophy, D. Reidel Publishing Company, 1987

Schöning,1995

Uwe Schöning. Theorethische Informatik - kurzgefasst. Spektrum Akademischer Verlag, 1995

Schmid,1998

Helmut Schmid. Parsing I. Seminarskript, Wintersemester 1998/99, University of Magdeburg, 1998

Seki,Matsumura,Fujii,Kasami,1991

H. Seki, T. Matsumura, M. Fujii, T. Kasami. On multiple context-free grammars. In Theoretical Computer Science, Elsevier Science, Vol. 88, pages 191-229, 1991

Shannon,McCarthy,1956

C.E. Shannon, John McCarthy. Automata Studies. Annals of Mathematics Studies, No. 34, Princeton University Press, 1956

Shieber,1985

Stuart M. Shieber. Evidence against the Context-Freeness of Natural Language. Linguistics and Philosophy, Vol. 8, pages 333-343, 1985

Shieber,Schabes,Pereira,1993

Stuart M. Shieber, Yves Schabes, Fernando C.N. Pereira. Principles and Implementation of Deductive Parsing. The Journal of Logic Programming, Elsevier Science Publishing Co. Inc., 1993

Sikkel,Nijhold,1997

Klaas Sikkel, Anton Nijhold. Parsing of Context-Free Languages. Handbook of Formal Languages, Vol. 2, G. Rozenberg, A. Salomaa Eds., Springer Berlin, 1997

Thue,1914

Axel Thue. Probleme über Veränderungen von Zeichenreihen nach gegebenen Regeln. Skrifter utgit av Videnskapsselskapet i Kristiana I, 10, 1915

Vijay-Shanker,Weir,Joshi,1987

K. Vijay-Shanker, David J. Weir, Aravind Joshi. Characterizing structural descriptions produced by various grammatical formalisms. In 25 Meeting of the Association for Computational Linguistics (ACL'87), 1987

Vijay-Shanker,Weir,Joshi,1987

K. Vijay-Shanker, David J. Weir, Aravind K. Joshi. On the progression from context-free to the tree adjoining languages. In A. Manaster-Ramer, Ed., Mathematics of Language, pages 389-401, John Benjamins, Amsterdam, 1987

Vijay-Shanker,1988

K. Vijay-Shanker. A study of TAGs. PhD thesis, University of Pennsylvania, 1988

Weir,1988

David K. Weir, Characterizing Mildly context-sensitive Grammar Formalisms. PhD thesis, University of Pennsylvania, 1988

Wilhelm,Maurer,1992

Reinhard Wilhelm, Dieter Maurer. Übersetzerbau: Theorie, Konstruktion, Generierung. Springer Berlin, 1992

Yu,1997

Sheng Yu. Regular Languages. Handbook of Formal Languages, Vol. 1, G. Rozenberg, A. Salomaa Eds., Springer Berlin, 1997