Deterministic finite automaton (DFA) definition

An example of a deterministic finite automaton would be a vending machine, that releases a product when use pays 3 or more ILS, no change is given.



Word function definition

Automaton language definition