Closure properties of decidability
Download
1 / 12

- PowerPoint PPT Presentation


  • 751 Views
  • Updated On :

Closure Properties of Decidability. Lecture 28 Section 3.2 Fri, Oct 26, 2007. Closure Properties of Decidable Languages. The class of decidable languages is closed under Union Intersection Concatenation Complementation Star. Closure Under Union.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about '' - starbuck


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Closure properties of decidability l.jpg

Closure Properties of Decidability

Lecture 28

Section 3.2

Fri, Oct 26, 2007


Closure properties of decidable languages l.jpg
Closure Properties of Decidable Languages

  • The class of decidable languages is closed under

    • Union

    • Intersection

    • Concatenation

    • Complementation

    • Star


Closure under union l.jpg
Closure Under Union

  • Theorem: If L1 and L2 are decidable, then L1L2 is decidable.

  • Proof:

    • Let D1 be a decider for L1 and let D2 be a decider for L2.

    • Then build a decider D for L1L2 as in the following diagram.


Closure of intersection l.jpg
Closure of Intersection

D

w

no

no

no

D1

D2

yes

yes

yes


Closure under union5 l.jpg
Closure Under Union

  • Theorem: If L1 and L2 are decidable, then L1L2 is decidable.

  • Proof:

    • Let D1 be a decider for L1 and let D2 be a decider for L2.

    • Then build a decider D for L1L2 as in the following diagram.


Closure of intersection6 l.jpg
Closure of Intersection

D

w

yes

yes

yes

D1

D2

no

no

no


Closure properties of recognizable languages l.jpg
Closure Properties of Recognizable Languages

  • The class of recognizable languages is closed under

    • Union

    • Intersection

    • Concatenation

    • Star


Closure under union8 l.jpg
Closure Under Union

  • Theorem: If L1 and L2 are recognizable, then L1L2 is recognizable.

  • Proof:

    • Let R1 be a recognizer for L1 and let R2 be a recognizer for L2.

    • Then build a recognizer R for L1L2 as in the following diagram.


Closure of intersection9 l.jpg
Closure of Intersection

R

w

yes

yes

yes

R1

R2


Closure under union10 l.jpg
Closure Under Union

  • Theorem: If L1 and L2 are recognizable, then L1L2 is recognizable.

  • Proof:

    • Let R1 be a recognizer for L1 and let R2 be a recognizer for L2.

    • Then build a recognizer R for L1L2 as in the following diagram.


Closure of union l.jpg

R

yes

R1

w

yes

yes

R2

Closure of Union


Closure of union12 l.jpg
Closure of Union

  • In that diagram, we must be careful to alternate execution between R1 and R2.


ad