Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Learn theory of computation
·
Module 9
Computability and the Chomsky Hierarchy
1
Turing Machine Acceptance and Halting: RE and Recursive Languages
Define recursively enumerable (RE) and recursive languages in terms of Turing Machine acceptance and halting.
2
Closure Properties of Recursive and RE Languages
Prove closure properties of recursive and RE languages under union and intersection.
3
Unrestricted Grammars and Turing Machines
Define unrestricted grammars and explain their equivalence to Turing Machines.
4
Context-Sensitive Grammars & Linear Bounded Automata
Define Context-Sensitive Grammars (CSGs) and Linear Bounded Automata (LBAs).
5
CSGs and LBAs: Understanding the Connection
Explain the relationship between CSGs and LBAs.
6
The Chomsky Hierarchy: Classifying Formal Languages
State the Chomsky Hierarchy and illustrate the proper containment of the language classes (regular, context-free, context-sensitive, recursive, RE).
Previous module
Turing Machines
Next module
Undecidability and Reducibility