October 18

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

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

View Full Document Right Arrow Icon
CSCI 2670 Introduction to Theory of Computing October 18, 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 18, 2005 Agenda • Last week – Decidable problems involving regular languages, finite automata, and CFG’s – One undecidable language •EQ CFG • This week – Undecidable languages – Techniques for showing a languages is not decidable
Background image of page 2
October 18, 2005 Announcements • Quiz tomorrow – Enumerators, definition of algorithm, decidable languages • Recommended problems – 4.6, 4.7, 4.22, 4.25, 4.26
Background image of page 3

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

View Full DocumentRight Arrow Icon
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
Background image of page 4
October 18, 2005 Relationship of classes of languages Regular Context- free Decidable Turing- recognizable
Background image of page 5

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

View Full DocumentRight Arrow Icon
October 18, 2005 Group project 1 F DFA = {<A> | A is a DFA and L(A) is finite}
Background image of page 6
October 18, 2005 Group project 2 PRIME = { n | n is a prime number}
Background image of page 7

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

View Full DocumentRight Arrow Icon
October 18, 2005 Group project 3 CONN = {<G> | G is a connected graph}
Background image of page 8
October 18, 2005 Group project 4 L10 DFA = {D | D is a DFA that accepts every string w with |w| = 10}
Background image of page 9

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

View Full DocumentRight Arrow Icon
October 18, 2005 Group project 5 INT CFG = {<G 1 , G 2 , w> | G 1 and G 2 are CFG’s and w is accepted by both}
Background image of page 10
October 18, 2005 Group project 6 INTL CFG = L(G 1 G 2 ), where G 1 and G 2 are CFG’s
Background image of page 11

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

View Full DocumentRight Arrow Icon
October 18, 2005 Turing machine acceptance problem
Background image of page 12
Image of page 13
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 28

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

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

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