Finite State Machines - Slides

# Finite State Machines - Slides - CSCI 232 CSCI 232 Computer...

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

SCI 232 CSCI 232 Computer Networking: Finite State Machines George Blankenship Finite State Machines George Blankenship 1

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

View Full Document
Outline • Background erminology Terminology • Notation l • Examples Finite State Machines George Blankenship 2
Background • One view of an algorithm is a sequence of steps • The sequence is fixed where the next step is dependent upon events that occur during the rrent step current step • Deterministic – each set of conditions yields ngle next step single next step • Closed set of independent variables – next step is function of only current state and events that a function of only current state and events that occur during state Finite State Machines George Blankenship 3

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

View Full Document
Turing Machines • The description of computational problems is by Alan uring Turing – Objective was to understand the basis of the computational environment – Key to understanding the algorithm is the notation used to describe the algorithm •C o m
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 09/03/2010 for the course CS 232 taught by Professor Susan during the Summer '09 term at GWU.

### Page1 / 10

Finite State Machines - Slides - CSCI 232 CSCI 232 Computer...

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

View Full Document
Ask a homework question - tutors are online