Abstract
In this chapter we establish the equivalence between the class of Turing computable languages and the class of type 0 grammars. In order to present this result, we recall some basic notions about the Turing Machines. More information on Turing Machines can be found in textbooks such as the one by Hopcroft-Ullman [9].
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). Turing Machines and Type 0 Grammars. In: Automata Theory and Formal Languages. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-031-11965-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-031-11965-1_5
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)