Draw a finite state machine by adding states and labelled transitions, then mark the start state and any accepting states (shown with a double circle). The state transition table updates as you draw, and you can export a PNG for a worksheet, slide or revision note.
Type a regular expression using * + ? | and ( ), and the tool builds the smallest equivalent FSM for you. Then trace any input string one symbol at a time to see the path it takes and whether it is accepted or rejected.
Transitions can carry outputs too: label a transition a|1 to draw a Mealy machine, and the trace will show the output string. Separate several inputs on one arrow with commas, for example a, b.
Finite state machines (with and without output), state transition tables and regular expressions, AQA A-Level (7517) 4.4.2.
Want one-to-one help with this topic? I'm Damian Biasone, a qualified Computer Science teacher with 20 years' experience, tutoring GCSE and A-Level students online.
OCR A-Level (H446) tuitionAQA A-Level (7517) tuition