August 25

August 25 - 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 August 25, 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
Agenda Last class Defined regular languages Discussed creating DFA’s This class Finish Section 1.1 Next week Section 1.2 (pages 47 – 63)
Background image of page 2
Announcement Tutorials will be with Ryan Foster (room TBA) Monday 2:30 – 3:30 Friday 10:00 – 11:00 Hint on problem 0.12 The proof can be done without induction.  What can  you conclude if all nodes have different degrees?  In a  graph with n nodes, what are the possible values for  the degree of any node?
Background image of page 3

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

View Full DocumentRight Arrow Icon
Designing finite automata Select states specifically to reflect some important  concept Ensure this meaning is relevant to the language  you are trying to define Try to get “in the head” of the automaton Can also design a DFA by combining two other  DFA’s
Background image of page 4
Combining regular languages We can create a regular language from other 
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 / 17

August 25 - 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