Deterministic Finite Automata

This DFA accepts strings over the alphabet \(\{a, b\}\) with an even number of 'a's. Enter a string, then press 'Run' to see the full animation, 'Step' to process one character at a time, or 'Reset' to start over.

Superpowers for your classroom

Copyright © 2025 Tutorly Technologies Inc.

All Rights Reserved