Scribd
Upload
31 views

Summary

We have encountered five major classes of languages and machines. This shall be done in a series of charts. Each is a proper subclass of those above it.

Uploaded by

Anuja Khamitkar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
31 views

Summary

We have encountered five major classes of languages and machines. This shall be done in a series of charts. Each is a proper subclass of those above it.

Uploaded by

Anuja Khamitkar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Summary

We have encountered five major classes of languages and machines in our


examination of computation. Now seems like a good time to sum up some of
the things we have discovered for all of these classes. This shall be done in a
series of charts.

The first sets forth these classes or families in descending order. Each is a
proper subclass of those above it. (Note that the last column provides a set in
the class which does not belong to the one below.)

Class Machine Language Example


Recursively Turing K
Type 0
Enumerable Sets Machines
Recursive Sets diagonal sets
Context Linear
Sensitive Bounded Type 1 n n n
0 1 0
Languages Automata
Context Free Pushdown invalid TM
Type 2
Languages Automata computations
Deterministic Deterministic
Context Free Pushdown LR(1) n n
a b
Languages Automata
Finite
Regular Sets Type 3
Automata

Next, we shall list the closure properties which were proven for each class or
mentioned in either the historical notes or exercises. Complement is indicated
by '¬' and concatenation is indicated by a dot.

Class ¬ ∪ ∩ • ∗
r.e. no yes yes yes yes
recursive yes yes yes yes yes
csl yes yes yes yes yes
cfl no yes no yes yes
dcfl yes no no no no
regular yes yes yes yes yes
Summary 2

Our last chart indicates the solvability or unsolvability of the decision problems
we have examined thus far. (S stands for solvable, U for unsolvable, and ? for
unknown.)

Class x∈L L=∅ L finite Li ⊂ Lj Li = Lj L = Σ* L cofinite


r.e. U U U U U U U
recursive S U U U U U U
csl S U U U U U U
cfl S S S U U U U
dcfl S S S U ? S S
regular S S S S S S S

You might also like