Differences between version 6 and previous revision of FiniteStateMachine.
Other diffs: Previous Major Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 6 | Last edited on Wednesday, November 14, 2007 7:29:11 am | by ShaneHowearth | Revert |
| Older page: | version 5 | Last edited on Friday, October 24, 2003 11:46:35 am | by StuartYeates | Revert |
@@ -1,3 +1,3 @@
-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].
+A conceptual model of a computer (or a computer program) which represents the computation
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].
One of the fundamental proofs in ComputerScience is that any result calculatable on a FiniteStateMachine is calculatable in LambdaCalculus.
