{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

0225-notes

# 0225-notes - CPSC 121 Lecture 19 Menu Topics Midterm Follow...

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

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 745–747), Designing a Finite Automaton (pages 752–754, 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 2–6 READ the WebCT Vista course announcements board 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 A sequential circuit, a circuit with state (or memory), can be modelled as a finite state machine (FSM). We begin with a motivational example. . . Task for Today Design a machine (eventually a circuit) that inputs characters from a finite alphabet (say 1 character per clock tick)

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.
• Spring '08
• BELLEVILLE
• Nondeterministic finite state machine, state transition, deterministic finite state, Deterministic Finite State Automata

{[ snackBarMessage ]}

### Page1 / 3

0225-notes - CPSC 121 Lecture 19 Menu Topics Midterm Follow...

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

View Full Document
Ask a homework question - tutors are online