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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rambow, Owen. 1994. Formal and Computational Aspects of Natural Language Syntax. Ph.D. thesis, University of Pennsylvania.
Weir, David J. 1988. Characterizing Mildly Context-Sensitive Grammar Formalisms. Ph.D. thesis, University of Pennsylvania.
Schabes, Yves and K.Vijay-Shanker. 1990. Deterministic left to right parsing of tree adjoining languages. In Proceedings of ACL, Pittsburgh.
Vijay-Shanker, K. 1987. A Study of Tree Adjoining Grammars. Ph.D. thesis, University of Pennsylvania.
Villemonte de la Clergerie, Éric. 2002. Parsing mildly context-sensitive languages with thread automata. In Proceedings of COLING’02, August.
Becker, Tilman. 1994. A new automaton model for TAGs: 2-SA. Computational Intelligence, 10(4):422–430.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Berlin Heidelberg
About this chapter
Cite this chapter
Kallmeyer, L. (2010). Automata. In: Parsing Beyond Context-Free Grammars. Cognitive Technologies, vol 0. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14846-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-14846-0_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14845-3
Online ISBN: 978-3-642-14846-0
eBook Packages: Computer ScienceComputer Science (R0)