18.404/6.840 Lecture 7 Last time: - Equivalence of

tatyana-admore
Published  . 0 views
↓ Download
18.404/6.840 Lecture 7 Last time: - Equivalence of
1 / 1
18.404/6.840 Lecture 7 Last time: - Equivalence of - slide 1 of 12 18.404/6.840 Lecture 7 Last time: - Equivalence of - slide 2 of 12 18.404/6.840 Lecture 7 Last time: - Equivalence of - slide 3 of 12 18.404/6.840 Lecture 7 Last time: - Equivalence of - slide 4 of 12 18.404/6.840 Lecture 7 Last time: - Equivalence of - slide 5 of 12 18.404/6.840 Lecture 7 Last time: - Equivalence of - slide 6 of 12 18.404/6.840 Lecture 7 Last time: - Equivalence of - slide 7 of 12 18.404/6.840 Lecture 7 Last time: - Equivalence of - slide 8 of 12 18.404/6.840 Lecture 7 Last time: - Equivalence of - slide 9 of 12 18.404/6.840 Lecture 7 Last time: - Equivalence of - slide 10 of 12 18.404/6.840 Lecture 7 Last time: - Equivalence of - slide 11 of 12 18.404/6.840 Lecture 7 Last time: - Equivalence of - slide 12 of 12
Description: 18.4046.840 Lecture 7 Last time: - Equivalence of variants of the Turing machine model a. Multi-tape TMs b. Nondeterministic TMs c. Enumerators - Church-Turing Thesis - Notation for encodings and TMs Today: (Sipser 4.1) - Decision

Related Topics

Download Presentation

"18.404/6.840 Lecture 7 Last time: - Equivalence of" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

Presentation Transcript

slide1. 18.404/6.840 Lecture 7 Last time: - Equivalence of variants of the Turing machine model
a. Multi-tape TMs
b. Nondeterministic TMs
c. Enumerators
- Church-Turing Thesis
- Notation for encodings and TMs

Today: (Sipser §4.1) - Decision procedures for automata and grammars 1<br>
slide2. TMs and Encodings – review 2<br>
slide3. Acceptance Problem for DFAs 3<br>
slide4. Acceptance Problem for NFAs 4<br>
slide5. Emptiness Problem for DFAs 5<br>
slide6. Equivalence problem for DFAs Symmetric difference Check-in 7.1 6<br>
slide7. Acceptance Problem for CFGs Check-in 7.2 7<br>
slide8. Emptiness Problem for CFGs a T a b T T S R R 8<br>
slide9. Equivalence Problem for CFGs Check-in 7.3 9<br>
slide10. Acceptance Problem for TMs 10<br>
slide11. Quick review of today 11<br>
slide12. MIT OpenCourseWare
https://ocw.mit.edu

18.404J Theory of Computation
Fall 2020

For information about citing these materials or our Terms of Use, visit: https://ocw.mit.edu/terms.<br>