Add to ORKGJevons' language was defined between 1865 and 1870 to describe a set of logical formulas. This language is regular, the fact was obviously not know by the author 140 years ago. We propose here an analyzer recognizing this language. It is a composition of 2-state automata. Jevons described a process of evaluation for logical problems described by formulas in the language. This evaluation can also be described by a finite state mechanism given in this paper. The evaluation is based on a synchronous cooperation of several processors. We experimented with Lustre environment to establish equivalence between two evaluatioan techniques, one of them being Jevons' one. The paper then presents historical elements about Jevons and his work
Abstract. The automata-theoretic approach to linear temporal logic uses the theory of automata as a ...
Mathematical models in classical computation, automata have been an important area in theoretical co...
There are two languages of the Automath family that have been developed for practical (in contrast w...
In this paper, we describe a formal language for a class of logical expressions. We then present a F...
In this paper, we describe a formal language for a class of logical expressions. We then present a F...
In 1870 a British scholar, W.S. Jevons, built the first computer designed to solve logical problem. ...
In this diploma work the concept of formal language is presented, introducing the ideas related to ...
This paper introduces and discusses automata systems as a new way for formal languages processing. I...
These notes form the core of a future book on the algebraic foundations of automata theory. This boo...
A finite state language is a finite or infinite set of strings (sentences) of symbols (words) genera...
This paper introduces the theory of twodimensional languages automata in comparision to the classic ...
Computation is employed to incredible success in a massive variety of applications, and yet it is di...
This thesis gives an account of the author’s language theoretical studies on the Automath languages,...
Abstract. The relationship between automata and logics has been in-vestigated since the 1960s. In pa...
Written to address the fundamentals of formal languages, automata, and computabilty, An Introduction...
Abstract. The automata-theoretic approach to linear temporal logic uses the theory of automata as a ...
Mathematical models in classical computation, automata have been an important area in theoretical co...
There are two languages of the Automath family that have been developed for practical (in contrast w...
In this paper, we describe a formal language for a class of logical expressions. We then present a F...
In this paper, we describe a formal language for a class of logical expressions. We then present a F...
In 1870 a British scholar, W.S. Jevons, built the first computer designed to solve logical problem. ...
In this diploma work the concept of formal language is presented, introducing the ideas related to ...
This paper introduces and discusses automata systems as a new way for formal languages processing. I...
These notes form the core of a future book on the algebraic foundations of automata theory. This boo...
A finite state language is a finite or infinite set of strings (sentences) of symbols (words) genera...
This paper introduces the theory of twodimensional languages automata in comparision to the classic ...
Computation is employed to incredible success in a massive variety of applications, and yet it is di...
This thesis gives an account of the author’s language theoretical studies on the Automath languages,...
Abstract. The relationship between automata and logics has been in-vestigated since the 1960s. In pa...
Written to address the fundamentals of formal languages, automata, and computabilty, An Introduction...
Abstract. The automata-theoretic approach to linear temporal logic uses the theory of automata as a ...
Mathematical models in classical computation, automata have been an important area in theoretical co...
There are two languages of the Automath family that have been developed for practical (in contrast w...