Concepts of reduction and minimization are formulated in a general setting inorder to unify and classify the different constructions in automata and system theory. In addition to a unified theory for deterministic, partial, linear and topological automata, which is partly known, a common theory for nondeterministic, relational, stochastic and relation topological automata is developed using the notion of automata in pseudoclosed categories. Moreover, an approach to a general theory of reduction and minimization is given and applied to a great number of examples in automata and system theory
In the classical theory of formal languages, finite state automata allow to recognize the words of a...
This paper uses category theory to emphasize the relationships between Mealy, Moore and Rabin-Scott ...
These notes form the core of a future book on the algebraic foundations of automata theory. This boo...
Automata Theory is part of computability theory which covers problems in computer systems, software,...
AbstractWe introduce a new class of tree automata, which we call Reduction Automata (RA), and we use...
This paper presents a taxonomy of finite automata minimization algorithms. Brzozowski's elegant...
AbstractWe present three possible approaches to a homology theory of automata. Two of these require ...
AbstractDeterministic automata can be minimized by partition refinement (Moore's algorithm, Hopcroft...
This paper studies the algorithms for the minimisation of weighted automata. It starts with the defi...
Automata and Dynamical Systems Theory both rest on a common mathematical structure. In this work the...
This paper is an attempt to unify classical automata theory and dynamical systems theory. We present...
International audienceDeterministic automata can be minimized by partition refinement (Moore's algor...
. The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying...
We describe a new elementary reduction of two-way automata to one-way automata. The reduction is bas...
This paper is an attempt to unify classical automata theory and dynamical systems theory. We present...
In the classical theory of formal languages, finite state automata allow to recognize the words of a...
This paper uses category theory to emphasize the relationships between Mealy, Moore and Rabin-Scott ...
These notes form the core of a future book on the algebraic foundations of automata theory. This boo...
Automata Theory is part of computability theory which covers problems in computer systems, software,...
AbstractWe introduce a new class of tree automata, which we call Reduction Automata (RA), and we use...
This paper presents a taxonomy of finite automata minimization algorithms. Brzozowski's elegant...
AbstractWe present three possible approaches to a homology theory of automata. Two of these require ...
AbstractDeterministic automata can be minimized by partition refinement (Moore's algorithm, Hopcroft...
This paper studies the algorithms for the minimisation of weighted automata. It starts with the defi...
Automata and Dynamical Systems Theory both rest on a common mathematical structure. In this work the...
This paper is an attempt to unify classical automata theory and dynamical systems theory. We present...
International audienceDeterministic automata can be minimized by partition refinement (Moore's algor...
. The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying...
We describe a new elementary reduction of two-way automata to one-way automata. The reduction is bas...
This paper is an attempt to unify classical automata theory and dynamical systems theory. We present...
In the classical theory of formal languages, finite state automata allow to recognize the words of a...
This paper uses category theory to emphasize the relationships between Mealy, Moore and Rabin-Scott ...
These notes form the core of a future book on the algebraic foundations of automata theory. This boo...