{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

October 26 - CSCI 2670 Introduction to Theory of Computing...

Info icon This preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
CSCI 2670 Introduction to Theory of Computing October 26, 2005
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
October 26, 2005 Agenda • Yesterday – Test • Today – Begin Chapter 5 • Pages 187 – 192 • Old text pages 171 – 176)
Image of page 2
October 26, 2005 Announcement In Chapter 5 we will skip from page 192 to page 206 – Old text skip from 176 to 183 Homework due next Wednesday (11/3) – Show the following languages are not decidable • T = {<M> | M is a TM with L(M) R = L(M)} i.e., w R L(M) whenever w L(M) (prob. 5.9) • G = {<M> | M is a TM s.t. L(M) is context-free} • F = {<M> | M is a TM with |L(M)| = 5}
Image of page 3

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon