By extracting the basic properties common to the automata appeared in existing literatures, we develop a general formulation of automata with “weights”. We define a pseudoautomaton and derive from it the well-known deterministic automaton, nondeterministic automaton, probabilistic automaton, fuzzy automaton, and so on. Moreover, several interesting automata such as l-semigroup automaton, lattice automaton, dual lattice automaton, mixed boolean automaton, semiring automaton, ring automaton and field automaton which have never appeared in any other paper before are derived
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weight...
AbstractWeighted automata model quantitative aspects of systems like memory or power consumption. Re...
In this paper we propose a notion of weak bisimulation for a class of weighted automata with unobser...
By extracting the basic properties common to the automata appeared in existing literatures, we devel...
AbstractWeighted automata are used to describe quantitative properties in various areas such as prob...
Automata have long been recognized as a useful mechanism for solving logic-based reasoning tasks. Fo...
Abstract. Weighted automata are used to describe quantitative prop-erties in various areas such as p...
SIGLEAvailable from TIB Hannover: RR 7739(02,02) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - ...
htmlabstractWeighted automata are a generalization of non-deterministic automata where each transiti...
Weighted automata are a generalization of nondeterministic automata thatassociate a weight drawn fro...
Weighted automata generalize a number of concepts found in discrete event dynamics systems of variou...
This paper studies the algorithms for the minimisation of weighted automata. It starts with the defi...
International audienceThis paper deals with one-way and two-way weighted automata. When the semiring...
Concepts of reduction and minimization are formulated in a general setting inorder to unify and clas...
The subject of this thesis is decided into three parts: two of them are about extensions of the clas...
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weight...
AbstractWeighted automata model quantitative aspects of systems like memory or power consumption. Re...
In this paper we propose a notion of weak bisimulation for a class of weighted automata with unobser...
By extracting the basic properties common to the automata appeared in existing literatures, we devel...
AbstractWeighted automata are used to describe quantitative properties in various areas such as prob...
Automata have long been recognized as a useful mechanism for solving logic-based reasoning tasks. Fo...
Abstract. Weighted automata are used to describe quantitative prop-erties in various areas such as p...
SIGLEAvailable from TIB Hannover: RR 7739(02,02) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - ...
htmlabstractWeighted automata are a generalization of non-deterministic automata where each transiti...
Weighted automata are a generalization of nondeterministic automata thatassociate a weight drawn fro...
Weighted automata generalize a number of concepts found in discrete event dynamics systems of variou...
This paper studies the algorithms for the minimisation of weighted automata. It starts with the defi...
International audienceThis paper deals with one-way and two-way weighted automata. When the semiring...
Concepts of reduction and minimization are formulated in a general setting inorder to unify and clas...
The subject of this thesis is decided into three parts: two of them are about extensions of the clas...
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weight...
AbstractWeighted automata model quantitative aspects of systems like memory or power consumption. Re...
In this paper we propose a notion of weak bisimulation for a class of weighted automata with unobser...