Skip to content
MathsGenie logo
Open app

Course home

x

FSMs, strings and outputs

FSMs, strings and outputs

State transition diagrams showing an FSM that accepts binary strings ending in 01 and a Mealy machine that outputs 1 when the latest two input symbols are 01

A regular language is a set of strings that can be recognised by a finite state machine, or FSM. An alphabet is a finite set of symbols such as {0,1}\{0, 1\}{0,1}, and a string is a sequence of those symbols such as 110111011101.

Regular languages Lesson

  1. AS Level
  2. /Computer Science
  3. /Regular languages

Step-by-step lessons covering AQA AS Level Computer Science Regular languages for AS Level Computer Science. Each lesson works through exam-style questions.

Lessons