W. Stanley Jevons, Allan Marquand, and the Origins of Digital Computing
IEEE Annals of the History of Computing
Synchronous Programming of Reactive Systems
Synchronous Programming of Reactive Systems
Recognizing Regular Expressions by Means of Dataflow Networks
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
W. S. Jevons: his Logical Machine and Work Induction and Boolean Algebra
Machine Intelligence 15, Intelligent Agents [St. Catherine's College, Oxford, July 1995]
Sequential Machines: Selected Papers
Sequential Machines: Selected Papers
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Some remarks on asynchronous automata
DLT'02 Proceedings of the 6th international conference on Developments in language theory
| Hi-index | 0.00 |
In this paper, we describe a formal language for a class of logical expressions. We then present a Finite State Machine for recognition and evaluation of this language. The main interest of the language is its historical characteristic. This language invented by the British scholar W. Stanley JEVONS in 1865 is probably the earliest language in which expressions were evaluated by a Finite State Machine. The two outstanding contributions were the use of machinery to evaluate formulas and the evaluation of formulas with variables by several parallel evaluations with constants. The contribution of this paper is to present this ancient evaluation process in a contemporary framework, i.e. formal languages and finite state automata. The design of an evaluator is given in great detail.