Differences between version 4 and predecessor to the previous major change of FiniteStateMachine.
Other diffs: Previous Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 4 | Last edited on Friday, October 24, 2003 10:41:41 am | by PerryLorier | Revert |
| Older page: | version 3 | Last edited on Friday, October 24, 2003 8:08:17 am | by CraigBox | Revert |
@@ -1 +1 @@
-A conceptual model of a computer (or a computer program) which represents the conputation in terms of a finite number of states and transitions between them. This is the closest commonly used paradigm to both the [TuringMachine] and JohnVonNeumann's automata, and is widely used in parsers. Often implmented
with the much-maligned [GoTo].
+A conceptual model of a computer (or a computer program) which represents the conputation in terms of a finite number of states and transitions between them. This is the closest commonly used paradigm to both the [TuringMachine] and JohnVonNeumann's automata, and is widely used in parsers. Often implemented
with the much-maligned [GoTo].
