Difference between revisions of "Finite State Machines"

From TRCCompSci - AQA Computer Science
Jump to: navigation, search
(Created page with "== Finite State Machines == A finite state machine is a way of breaking down a problem into several mutually independent '''states''' that are only able to change when a '''tr...")
 
m
Line 1: Line 1:
== Finite State Machines ==
+
{{Need_Expanding}}
 +
== Definition ==
 
A finite state machine is a way of breaking down a problem into several mutually independent '''states''' that are only able to change when a '''transition''' occurs.
 
A finite state machine is a way of breaking down a problem into several mutually independent '''states''' that are only able to change when a '''transition''' occurs.

Revision as of 15:52, 16 December 2016

This section needs expansion.
You can help by adding to it.

Definition

A finite state machine is a way of breaking down a problem into several mutually independent states that are only able to change when a transition occurs.