Amblard Paul: Finite state evaluation of logical formulas : Jevons' approach (1870) and contemporary description. In: Acta cybernetica, (17) 4. pp. 665-684. (2006)
Preview |
Cikk, tanulmány, mű
Amblard_2006_ActaCybernetica.pdf Download (211kB) | Preview |
Abstract
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.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 2006 |
| Volume: | 17 |
| Number: | 4 |
| ISSN: | 0324-721X |
| Page Range: | pp. 665-684 |
| Language: | English |
| Place of Publication: | Szeged |
| Event Title: | International Conference on Automata and Formal Languages (11.) (2005) (Dobogókő) |
| Related URLs: | http://acta.bibl.u-szeged.hu/38522/ |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika |
| Additional Information: | Bibliogr.: p. 682-684. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:25 |
| Last Modified: | 2022. Jun. 15. 13:22 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12790 |
Actions (login required)
 |
View Item |
