Difference between revisions of "Finite State Machines"

From TRCCompSci - AQA Computer Science
Jump to: navigation, search
m
Line 2: Line 2:
 
== Definition ==
 
== 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.
 +
 +
 +
== Finite State Automaton ==
 +
A finite state automaton is a finite state machine which has no output. It has a start state and a set of end/accept states. If the automaton can reach an end state then the input is accepted.

Revision as of 14:10, 3 January 2017

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.


Finite State Automaton

A finite state automaton is a finite state machine which has no output. It has a start state and a set of end/accept states. If the automaton can reach an end state then the input is accepted.