A simple automata implementation which supports 4 states and the finite alphabet {a, b, c, d, e, f}.
-
Updated
Jun 18, 2021 - Java
A simple automata implementation which supports 4 states and the finite alphabet {a, b, c, d, e, f}.
Add a description, image, and links to the patterns-in-software-engineering topic page so that developers can more easily learn about it.
To associate your repository with the patterns-in-software-engineering topic, visit your repo's landing page and select "manage topics."