Closure

Properties of
Decidable and
Recognizable
Languages

Robb T. Closure Properties of Decidable and

Koether
Recognizable Languages
Homework
Review Lecture 28
Closure
Properties of
Problems 3.15 and 3.16
Decidable
Languages
Intersection
Union
Robb T. Koether
Closure
Properties of
Recognizable Hampden-Sydney College
Languages
Intersection
Union

Assignment
Fri, Oct 31, 2008
 Outline

Closure
Properties of
Decidable and
Recognizable
Languages 1 Homework Review
Robb T.
Koether
2 Closure Properties of Decidable Languages
Homework
Review Intersection
Closure Union
Properties of
Decidable
Languages
Intersection 3 Closure Properties of Recognizable Languages
Union

Closure
Intersection
Properties of Union
Recognizable
Languages
Intersection
Union 4 Assignment
Assignment
 Homework Review

Closure
Properties of
Decidable and
Recognizable
Languages
Exercise 3.6, page 160.
Robb T.
Koether In Theorem 3.21 we showed that a language is
Homework
Turing-recognizable iff some enumerator enumerates it.
Review Why didn’t we use the following simpler algorithm for the
Closure
Properties of
forward direction of the proof? As before, s1 , s2 , . . . is a list of
Decidable
Languages
all strings in Σ∗ .
Intersection
Union
E = “Ignore the input.
Closure 1 Repeat the following for i = 1, 2, 3, . . .
Properties of
Recognizable
Languages
2 Run M on si .
Intersection
Union
3 If it accepts, print out si .”
Assignment
 Homework Review

Closure
Properties of
Decidable and
Recognizable
Languages

Robb T.
Exercise 3.7, page 160.
Koether
Explain why the following is not a description of a legitimate
Homework
Review
Turing machine.
Closure
Mbad = “The input is a polynomial p over variables x1 , . . . , xn .
Properties of
Decidable
Languages
Intersection
1 Try all possible settings of x1 , . . . , xn to integer values.
Union

Closure
2 Evaluate p on all of these settings.
Properties of
Recognizable
3 If any of these settings evaluates to 0, accept;
Languages
Intersection
otherwise, reject.”
Union

Assignment
 Closure Properties of Decidable Languages

Closure
Properties of
Decidable and
Recognizable
Languages

Robb T.
Koether Theorem (Closure Properties of Decidable Languages)
Homework The class of decidable languages is closed under
Review

Closure
Union
Properties of
Decidable Intersection
Languages
Intersection Complementation
Union

Closure Concatenation
Properties of
Recognizable Star
Languages
Intersection
Union

Assignment
 Closure Under Intersection

Closure
Properties of
Decidable and
Recognizable
Languages

Robb T.
Koether

Homework
Review
Theorem
Closure
Properties of
Decidable
If L1 and L2 are decidable, then L1 ∩ L2 is decidable.
Languages
Intersection
Union

Closure
Properties of
Recognizable
Languages
Intersection
Union

Assignment
 Closure of Intersection

Closure
Properties of
Decidable and
Recognizable Proof.
Languages

Robb T.
Let D1 be a decider for L1 and let D2 be a decider for L2 .
Koether
Then build a decider D for L1 ∩ L2 as in the following
Homework diagram.
Review

Closure
Properties of
Decidable
D
Languages w yes yes yes
Intersection
D1 D2
Union
no no
Closure
Properties of no
Recognizable
Languages
Intersection
Union

Assignment
 Closure Under Union

Closure
Properties of
Decidable and
Recognizable
Languages

Robb T.
Koether

Homework
Review
Theorem
Closure
Properties of
Decidable
If L1 and L2 are decidable, then L1 ∪ L2 is decidable.
Languages
Intersection
Union

Closure
Properties of
Recognizable
Languages
Intersection
Union

Assignment
 Closure Under Union

Closure
Properties of
Decidable and
Recognizable Proof.
Languages

Robb T.
Let D1 be a decider for L1 and let D2 be a decider for L2 .
Koether
Then build a decider D for L1 ∪ L2 as in the following
Homework diagram.
Review

Closure
Properties of
Decidable
D
Languages w no no no
Intersection
D1 D2
Union
yes yes
Closure
Properties of yes
Recognizable
Languages
Intersection
Union

Assignment
 Closure Under Other Operators

Closure
Properties of
Decidable and
Recognizable
Languages

Robb T.
Koether

Homework How would we show that if L1 and L2 are decidable,

Review
then so are
Closure
Properties of L1 L2
Decidable
Languages
L1
Intersection L1∗
Union

Closure
Properties of
Recognizable
Languages
Intersection
Union

Assignment
 Closure Properties of Recognizable Languages

Closure
Properties of
Decidable and
Recognizable
Languages

Robb T.
Koether
Theorem (Closure Properties of Recognizable Languages)
Homework
Review The class of recognizable languages is closed under
Closure Union
Properties of
Decidable
Languages
Intersection
Intersection
Union Concatenation
Closure
Properties of
Star
Recognizable
Languages
Intersection
Union

Assignment
 Closure Under Intersection

Closure
Properties of
Decidable and
Recognizable
Languages

Robb T.
Koether

Homework
Review
Theorem
Closure
Properties of
Decidable
If L1 and L2 are recognizable, then L1 ∩ L2 is recognizable.
Languages
Intersection
Union

Closure
Properties of
Recognizable
Languages
Intersection
Union

Assignment
 Closure Under Intersection

Closure
Properties of
Decidable and
Recognizable
Languages
Proof.
Robb T. Let R1 be a recognizer for L1 and let R2 be a recognizer
Koether
for L2 .
Homework
Review Then build a recognizer R for L1 ∩ L2 as in the following
Closure diagram.
Properties of
Decidable
Languages
Intersection R
Union w yes yes yes
Closure
R1 R2
Properties of
Recognizable
Languages
Intersection
Union

Assignment
 Closure Under Union

Closure
Properties of
Decidable and
Recognizable
Languages

Robb T.
Koether

Homework
Review
Theorem
Closure
Properties of
Decidable
If L1 and L2 are recognizable, then L1 ∪ L2 is recognizable.
Languages
Intersection
Union

Closure
Properties of
Recognizable
Languages
Intersection
Union

Assignment
 Closure Under Union

Closure
Properties of Proof.
Decidable and
Recognizable Let R1 be a recognizer for L1 and let R2 be a recognizer
Languages

Robb T.
for L2 .
Koether
Then build a recognizer R for L1 ∪ L2 as in the following
Homework diagram.
Review

Closure
Properties of R
Decidable
Languages yes
Intersection
R1
Union
w yes
Closure
Properties of
Recognizable
Languages yes
Intersection R2
Union

Assignment
 Closure of Union

Closure
Properties of
Decidable and
Recognizable
Languages

Robb T.
Koether

Homework Proof.
Review

Closure In that diagram, we must be careful to alternate

Properties of
Decidable execution between R1 and R2 .
Languages
Intersection
Union

Closure
Properties of
Recognizable
Languages
Intersection
Union

Assignment
 Closure Under Other Operators

Closure
Properties of
Decidable and
Recognizable
Languages

Robb T.
Koether

Homework How would we show that if L1 and L2 are recognizable,

Review then so are
Closure
Properties of L1 L2
Decidable
Languages
L1∗
Intersection
Union
Why is L1 not necessarily recognizable?
Closure
Properties of
Recognizable
Languages
Intersection
Union

Assignment
 Assignment

Closure
Properties of
Decidable and
Recognizable
Languages

Robb T.
Koether

Homework
Review Homework
Closure
Properties of
Read Section 3.2, pages 152 - 154.
Decidable
Languages Problems 15, 16, page 161.
Intersection
Union

Closure
Properties of
Recognizable
Languages
Intersection
Union

Assignment