October 12

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

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
CSCI 2670 Introduction to Theory of Computing October 12, 2005
Background image of page 1

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

View Full DocumentRight Arrow Icon
October 12, 2005 2 Agenda Yesterday Enumerators Equivalence of enumerators and TM’s Definition of algorithm Church-Turing thesis Decidable languages Today More on DFA’s and decidability Tomorrow CFG’s and decidability
Background image of page 2
October 12, 2005 3 Decidable languages A language is decidable if some Turing machine  decides it Every string in  Σ *  is either accepted or rejected Not all languages can be decided by a Turing  machine
Background image of page 3

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

View Full DocumentRight Arrow Icon
October 12, 2005 4 Some decidable languages • A DFA  = {<B,w> | B is a DFA that accepts input  string w} • A NFA  = {<B,w> | B is an NFA that accepts input  string w} • A REX  = {<R,w> | R is a regular expression that  generates string w}
Background image of page 4
October 12, 2005 5 Emptiness testing problem Consider the language  E DFA  = {<A> | A is a DFA and L(A) =  } Theorem:
Background image of page 5

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

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/07/2011 for the course CS 501 taught by Professor Sm during the Spring '11 term at Indiana.

Page1 / 9

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

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online