Skip to main content

Turing Machines and Type 0 Grammars

  • Chapter
  • First Online:
Automata Theory and Formal Languages

Part of the book series: Undergraduate Topics in Computer Science ((UTICS))

  • 788 Accesses

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].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alberto Pettorossi .

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

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)

Publish with us

Policies and ethics