0227-notes

0227-notes - CPSC 121 Lecture 20 February 27, 2009 Menu...

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

View Full Document Right Arrow Icon
CPSC 121 Lecture 20 February 27, 2009 Menu February 27, 2009 Topics: Deterministic Finite State Automata (cont’d) Reading: Today: Epp 4.1 (as background) Epp 4.2 Reminders: Marked Assignment 2 available in tutorials — solution posted to Sample Solutions area of the course WebCT site Lab 5 week of March 2–6 READ the WebCT Vista course announcements board Recall: Epp 4.1 provides background information for our treatment of mathematical induction. We don’t intend to directly assess anything from Epp 4.1. But, assignment and exam questions may require skills and knowledge from Epp 4.1 to answer. Deterministic Finite State Automata (cont’d) Recall: We represent finite state automata using either state diagrams or state tables. State transition diagrams help to visualize what’s happening. State transition tables, being exhaustive, help to make sure there are not state transitions that we’ve accidently ommitted.
Background image of page 1

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

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

Page1 / 2

0227-notes - CPSC 121 Lecture 20 February 27, 2009 Menu...

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

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