Theory of Computation

  1. Context-Sensitive and Unrestricted Languages
    1. Context-Sensitive Grammars
      1. CSG Definition
        1. Non-contracting Productions
          1. Language Generation
          2. Linear Bounded Automata
            1. LBA Definition
              1. Tape Bounds
                1. Equivalence with CSGs
                2. Unrestricted Grammars
                  1. Type-0 Grammar Definition
                    1. Phrase Structure Grammars
                      1. Equivalence with Turing Machines
                      2. Chomsky Hierarchy
                        1. Type-0: Recursively Enumerable
                          1. Type-1: Context-Sensitive
                            1. Type-2: Context-Free
                              1. Type-3: Regular
                                1. Proper Inclusions
                                  1. Closure Properties Summary

                                Previous

                                3. Context-Free Languages

                                Go to top

                                Next

                                5. Turing Machines and Computability