This paper investigates the concepts of relational homomorphisms and their closely associated concepts of generalized congruence relations on automata which are in general incomplete, nondeterministic, and infinite. The concept of generalized isomorphism, which is a natural extension of the isomorphism concept in dealing with nondeterministic automata, is also studied
The classes of automata characterized by certain semigroups are investigated: It isshown that the cl...
The purpose of this paper is to show that the endomorphism semigroup of a finite automaton may be us...
In this paper, we deal with nondeterministic automata, in particular, commutative asynchronous ones....
This paper investigates the concepts of relational homomorphisms and their closely associated concep...
AbstractSuppose that a relational system R can be exhausted (in an obvious sense) by a family Rω, ω ...
AbstractThis paper is concerned with connections between two different ways to prove decidability re...
AbstractThis paper is concerned with connections between two different ways to prove decidability re...
AbstractA necessary and sufficient condition is given for a class of automata to be (homomorphically...
AbstractIn this work it is shown that the general product is equivalent to the cube-product with res...
AbstractThe notion of an irreducible semigroup has been fundamental to the Krohn-Rhodes decompositio...
In this paper we introduce the concept of the quasi-product of tree automata. In a quasi-product the...
AbstractA concept of congruence relation and homomorphism for multialgebras is developed such that a...
Vita.This work is an outgrowth of recent work done investigating the transfer of information between...
Vita.This work is an outgrowth of recent work done investigating the transfer of information between...
AbstractIn this work it is shown that the general product is equivalent to the cube-product with res...
The classes of automata characterized by certain semigroups are investigated: It isshown that the cl...
The purpose of this paper is to show that the endomorphism semigroup of a finite automaton may be us...
In this paper, we deal with nondeterministic automata, in particular, commutative asynchronous ones....
This paper investigates the concepts of relational homomorphisms and their closely associated concep...
AbstractSuppose that a relational system R can be exhausted (in an obvious sense) by a family Rω, ω ...
AbstractThis paper is concerned with connections between two different ways to prove decidability re...
AbstractThis paper is concerned with connections between two different ways to prove decidability re...
AbstractA necessary and sufficient condition is given for a class of automata to be (homomorphically...
AbstractIn this work it is shown that the general product is equivalent to the cube-product with res...
AbstractThe notion of an irreducible semigroup has been fundamental to the Krohn-Rhodes decompositio...
In this paper we introduce the concept of the quasi-product of tree automata. In a quasi-product the...
AbstractA concept of congruence relation and homomorphism for multialgebras is developed such that a...
Vita.This work is an outgrowth of recent work done investigating the transfer of information between...
Vita.This work is an outgrowth of recent work done investigating the transfer of information between...
AbstractIn this work it is shown that the general product is equivalent to the cube-product with res...
The classes of automata characterized by certain semigroups are investigated: It isshown that the cl...
The purpose of this paper is to show that the endomorphism semigroup of a finite automaton may be us...
In this paper, we deal with nondeterministic automata, in particular, commutative asynchronous ones....
DOI
Add to ORKG