October 19

# October 19 - CSCI 2670 Introduction to Theory of Computing...

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

CSCI 2670 Introduction to Theory of Computing October 19, 2005

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

View Full Document
October 19, 2005 Agenda •Yester day – A little more on decidable languages –Countab le sets •Today
Languages we know are decidable Language Input A DFA <D,w>, D is a DFA, w is a string A NFA <N,w>, N is an NFA, w is a string A REX <R,w>, R is an RE, w is a string E DFA <D>, D is a DFA and L(D) = EQ DFA L(R) <C,D>, C and D are both DFA’s and L(C) = L(D) R is a regular expression A CFG <G,w>, G is a CFG, w is a string E CFG <G>, G is a CFG L(G) G is a CFG

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

View Full Document
October 19, 2005 Comparing the size of infinite sets • Given two infinite sets A and B, is there any way of determining if |A|=|B| or if |A|>|B|? –Yes ! • Functional correspondence can show two infinite sets have the same number of elements • Diagonalization can show one infinite
October 19, 2005 Functional correspondence

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

View Full Document
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 / 12

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

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

View Full Document
Ask a homework question - tutors are online