Finite state machine: Difference between revisions

 

:refunding -> ready

 

;Task:

Implement a finite state machine which handles both explicit and implicit transitions. Then demonstrate an example which models some real-world process.

 

;See also:

*[https://www.youtube.com/watch?v=vhiiia1_hC4 Computers Without Memory (Finite State Automata)], A Computerphile Video.

 

=={{header|BASIC}}==