Advertisement

Automata

Chapter
  • 989 Downloads
Part of the Cognitive Technologies book series (COGTECH, volume 0)

Abstract

We have seen the definitions of Finite State Automata (FSA) and of Push-Down Automata (PDA) in Chapter 1. The former accept all regular languages while the latter accept all context-free languages. In this chapter, we present automaton models for different extensions of CFG, in particular for TAG and LCFRS.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

  1. Rambow, Owen. 1994. Formal and Computational Aspects of Natural Language Syntax. Ph.D. thesis, University of Pennsylvania.Google Scholar
  2. Weir, David J. 1988. Characterizing Mildly Context-Sensitive Grammar Formalisms. Ph.D. thesis, University of Pennsylvania.Google Scholar
  3. Schabes, Yves and K.Vijay-Shanker. 1990. Deterministic left to right parsing of tree adjoining languages. In Proceedings of ACL, Pittsburgh.Google Scholar
  4. Vijay-Shanker, K. 1987. A Study of Tree Adjoining Grammars. Ph.D. thesis, University of Pennsylvania.Google Scholar
  5. Villemonte de la Clergerie, Éric. 2002. Parsing mildly context-sensitive languages with thread automata. In Proceedings of COLING’02, August.Google Scholar
  6. Becker, Tilman. 1994. A new automaton model for TAGs: 2-SA. Computational Intelligence, 10(4):422–430.CrossRefGoogle Scholar

Copyright information

© Springer Berlin Heidelberg 2010

Authors and Affiliations

  1. 1.SFB 833Universität TübingenTübingenGermany

Personalised recommendations