the academic computer world now calls small state machines Discrete Finite Automations or something
in reply to Re: Re: Re: Clunky parsing problem, looking for simple solution
in thread Clunky parsing problem, looking for simple solution
I think a lot of terms are used, this being one of them. Determinisitic Finite State Automata, Turing Machines, Finite State Machines, Finite Sate Automata, State Transition Machine are all terms ive seen.
Yves / DeMerphq
Writing a good benchmark isnt as easy as it might look.