Abstract
In this chapter, different types of LA-grammar are defined via natural restrictions of its rule system. Then these grammar types are characterized in terms of their generative capacity and computational complexity.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hausser, R. (2001). Hierarchy of LA-grammar. In: Foundations of Computational Linguistics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04337-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-662-04337-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07626-8
Online ISBN: 978-3-662-04337-0
eBook Packages: Springer Book Archive