Abstract
In this chapter we first show that the notions of the context-sensitive grammars and the type 1 grammars are equivalent. Then we show that every context-sensitive language is a recursive set. Finally, we introduce the class of the linear bounded automata and we show that this class of automata is characterized by the fact that it accepts the set of the context-sensitive languages.
This is a preview of subscription content, log in via an institution to check access.
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
Corresponding author
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Pettorossi, A. (2022). Linear Bounded Automata and Context-Sensitive Grammars. In: Automata Theory and Formal Languages. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-031-11965-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-031-11965-1_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-11964-4
Online ISBN: 978-3-031-11965-1
eBook Packages: Computer ScienceComputer Science (R0)