This preview shows pages 1–5. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CSCI 2670 Introduction to Theory of Computing August 31, 2005 Announcements Quiz tomorrow Definition of DFAs and designing DFAs Office hours with TA Ryan Foster Monday 2:30 3:30 (Rm. 323) Friday 10:00 11:00 (Rm. 524) Change in homework policy I give your homework to the TA at 11:00 the day after its due I will accept it until that time Agenda Last class Discussed nondeterminism Equivalence of DFAs and NFAs Today Further exploration of equivalence of DFAs and NFAs Tomorrow Closure of regular languages under regular operators Another method for describing regular languages Nondeterministic finite automaton 1. Q is a finite set of states 2 . is a (finite) alphabet 3 . : Q P(Q) is the transition function 2200 maps to sets of states 1. q is the start state , and...
View
Full
Document
 Spring '11
 sm

Click to edit the document details