Scribd
Upload
55 views3 pages

4.2. Finite State Machines (FSMS)

The document discusses finite state machines (FSMs) without output including drawing and interpreting simple state transition diagrams and state transition tables. FSMs are computational models that are always in a fixed state and can only be in one state at a time, changing states based on the current state and input data. State transition diagrams visually represent FSMs using states, transitions, a start state, and an accepting state. State transition tables also notate the transition functions between states.

Uploaded by

Christine
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
55 views3 pages

4.2. Finite State Machines (FSMS)

The document discusses finite state machines (FSMs) without output including drawing and interpreting simple state transition diagrams and state transition tables. FSMs are computational models that are always in a fixed state and can only be in one state at a time, changing states based on the current state and input data. State transition diagrams visually represent FSMs using states, transitions, a start state, and an accepting state. State transition tables also notate the transition functions between states.

Uploaded by

Christine
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

AQA Computer Science AS Level

3.4.2 Finite state machines (FSMs)


Concise Notes

www.pmt.education
Specification:

3.4.2.1 Finite state machines (FSMs) without output:


Be able to draw and interpret simple state transition diagrams and state
transition tables for FSMs with no output.

www.pmt.education
Finite State Machines

● Computational models​ for machines that are ​always in a fixed state


● Have a ​finite number of states
● Can ​only ever be in one state​ at once
● State changes depending on the ​current state​ and the ​input data
● If input data is valid, the FSM will terminate in an ​accepting state
● State changes according to​ transition rules

State Transition Diagrams

● A ​visual representation​ of a finite state machine


● Consist of ​states ​(circles) joined by ​transitions ​(arrows)
● Always have a ​start state​, indicated with a leading arrow
● Always have an ​accepting state​ shown as a ​double circle
● Transition functions​ represented by an ​arrow ​between states

State Transition Tables

● Transition functions can be notated using a ​state transition table


● The table has columns for ​current state​, ​input ​and ​next state

www.pmt.education

You might also like