August 31

August 31 - 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 31, 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
Announcements • Quiz tomorrow – Definition of DFA’s and designing DFA’s • 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 it’s due – I will accept it until that time
Background image of page 2
Agenda • Last class – Discussed non-determinism – Equivalence of DFA’s and NFA’s •Today – Further exploration of equivalence of DFA’s and NFA’s • Tomorrow – Closure of regular languages under regular operators – Another method for describing regular languages
Background image of page 3

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

View Full DocumentRight Arrow Icon
Non-deterministic finite automaton A non-deterministic finite automaton is a 5-tuple (Q, Σ , δ ,q 0 ,F), where 1. Q is a finite set of states 2. Σ is a (finite) alphabet 3. δ : Q × Σ ε P (Q) is the transition function δ maps to sets of states 4. q 0 is the start state , and 5. F Q is the set of accept states
Background image of page 4
Equivalence of DFAs and NFAs 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 / 12

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