class4

class4 - cs3102 Theory of Computation Class 4...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: cs3102: Theory of Computation Class 4: Nondeterminism Spring 2010 University of Virginia David Evans PS1 is due now! Adding Nondeterminism 1 2 Deterministic machine: at every step, there is only one choice Nondeterministic machine: at some steps, there may be more than one choice. a a, b b b Nondeterminism in Practice Nondeterminism in Theory Omnipotent: Machine splits into a new machine for each choice; if any machine accepts, accept. Omniscient: Whenever it has to make a choice, machine always guesses right. Example NFA 1 2 3 a b a, b Defining DFAs A deterministic finite automaton is a 5-tuple: Q finite set (“states”) Σ finite set (“alphabet”) δ : Q × Σ → Q transition function q ∈ Q start state F ⊆ Q set of accepting states How do we need to change this to support nondeterminism ? Defining N FAs A non deterministic finite automaton is a 5-tuple: Q finite set (“states”) Σ finite set (“alphabet”) transition function q ∈ Q start state F ⊆ Q set of accepting states Output of transition function is a set of states, not just one state....
View Full Document

This note was uploaded on 04/05/2010 for the course CS 150 taught by Professor Humphreys,g during the Spring '08 term at UVA.

Page1 / 6

class4 - cs3102 Theory of Computation Class 4...

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

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