This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CPSC 121 Lecture 19 February 25, 2009 Menu February 25, 2009 Topics: Midterm Follow Up Discussion Deterministic Finite State Automata Reading: Today: Epp 12.2 (pages 745747), Designing a Finite Automaton (pages 752754, skipping part b of the examples) Next: 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 26 READ the WebCT Vista course announcements board Epp 4.1 provides background information for our treatment of mathematical induction. We dont 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 A sequential circuit, a circuit with state (or memory), can be modelled as a finite state machine (FSM). We begin with a motivational example......
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 The University of British Columbia.
 Spring '08
 BELLEVILLE

Click to edit the document details