Can I read AFD State Machine Examples on EtoBox?
AFD State Machine Examples by JorgeDante is a document available to read on EtoBox.
What is AFD State Machine Examples about?
The document describes two finite automata (AFDs). The first AFD uses the input symbols 1, 2, 5, 10, 20 and has states q0, q1, q2 etc. transitioning based on the symbol read. The second AFD uses input symbols for wash (l), rinse (e), spin (c) cycle for a washing machine and has states q0, q1, q3 with q3 as the accepting state. Both AFDs are defined by their quintuple notation specifying states, input alphabet, transition function, starting state and accepting states.
- Author
- JorgeDante
- Language
- EN