Concepts of Programming

Posted on April 25, 2015 by timlyg

Finite State Machines: In the most basic form, uses switch/cases syntax as implementation. One chief example being syntax highlighting. The aid to FSM is a state diagram, which obviously is not the same as flowcharts.

This entry was posted in Technical. Bookmark the permalink.

Leave a Reply

Your email address will not be published. Required fields are marked *

CAPTCHA

*

This site uses Akismet to reduce spam. Learn how your comment data is processed.