Finite state evaluation of logical formulas : Jevons' approach (1870) and contemporary description

Amblard, Paul: Finite state evaluation of logical formulas : Jevons' approach (1870) and contemporary description. Acta cybernetica, (17) 4. pp. 665-684. (2006)

[img] Cikk, tanulmány, mű
Amblard_2006_ActaCybernetica.pdf

Download (211kB)

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
Event Title: International Conference on Automata and Formal Languages, 11., 2005, Dobogókő
Journal or Publication Title: Acta cybernetica
Date: 2006
Volume: 17
Number: 4
Page Range: pp. 665-684
ISSN: 0324-721X
Language: angol
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: p. 682-684.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Jun. 05. 15:19
URI: http://acta.bibl.u-szeged.hu/id/eprint/12790

Actions (login required)

View Item View Item