AQA A-Level Computer Science notes on regular languages. Covers finite state machines, state diagrams, transition tables, Mealy machines, regular expressions, and their relationship to FSMs in defining regular languages—ideal for study and exam preparation.
Hestia Laurent
Classification: Study and Revision Guide
Page count: 2
Viewed: 12
Last update: a month ago
Crash report