Finite State Machines

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

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

View Full Document Right Arrow Icon
CSCI 232 - Computer Networks Finite State Machines George Blankenship 1 Finite State Machines George Blankenship 1 CSCI 232 Computer Networking: Finite State Machines George Blankenship Finite State Machines George Blankenship 2 Outline • Background • Terminology • Notation • Examples Finite State Machines George Blankenship 3 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 current step • Deterministic – each set of conditions yields single next step • Closed set of independent variables – next step is a function of only current state and events that occur during state
Background image of page 1

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

View Full DocumentRight Arrow Icon
CSCI 232 - Computer Networks Finite State Machines George Blankenship 2 Finite State Machines George Blankenship 4 Turing Machines • The description of computational problems is by Alan Turing – Objective was to understand the basis of the computational environment – Key to understanding the algorithm is the notation used to describe
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

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

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

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