This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CPSC 121 Lecture 35 April 6, 2009 Menu April 6, 2009 Topics: TA teaching evaluation Assignment/quiz/midterm return Regular Expressions and DFAs (concluded) Reminders: Look for On-line Quiz 12 Teaching evaluation survey now available on-line — deadline 23:00 April 12 Review session (Steve): Thu April 9, 9:00, DMP 310 Review session (Bob): Thu April 16, 14:00, DMP 110 Final exam Friday, April 17, 7:00pm, SRC A READ the WebCT Vista course announcements board Let’s consider something potentially more powerful, a Non-Deterministic Finite State Automaton (NFA). Non-Deterministic Finite State Automaton (NFA) A Non-Deterministic Finite State Automaton (NFA) is like a DFA except: • There can be multiple start states, not just one • There can be any number (zero, one or more) of arcs leading from each state to next states for each input alphabet character An NFA accepts a given input string when at least one of the states we end up in is accepting NFA (cont’d) Definition: A Non-Deterministic Finite State Automaton (NFA)...
View Full Document
This note was uploaded on 01/09/2010 for the course CPSC 121 taught by Professor Belleville during the Spring '08 term at UBC.
- Spring '08