In a category-theoretic treatment of automata, one is sometimes lead to consider various transcriptions or transductions of free monoids as a component of the morphisms in the category. It then becomes of interest to determine the epimorphisms in the underlying category of transductions. We study this question in several familiar settings centered around the notion of a gsm mapping
AbstractWe view CCS terms as defining nondeterministic automata. An algebraic representation of auto...
We propose a notion of morphisms between tree automata based on game semantics. Morphisms are winnin...
International audienceWe propose a notion of morphisms between tree automata based on game semantics...
In a category-theoretic treatment of automata, one is sometimes lead to consider various transcripti...
AbstractA matrix characterization is obtained for the epimorphisms in the category of finitely gener...
We extend the treatment of algebra automata to automata employing algebras over arbitrary theories. ...
AbstractA matrix characterization is obtained for the epimorphisms in the category of finitely gener...
We extend the treatment of algebra automata to automata employing algebras over arbitrary theories. ...
Content in the UH Research Archive is made available for personal research, educational, and non-com...
For alphabets Delta_1, Delta_2, a morphism g : Delta_1* to Delta_2* is ambiguous with respect to a w...
Eilenberg has shown that the notion of varieties in semigroups/monoids can be naturally made to cor...
This paper is a summary of my seminars given in the Research Group on Mathematical Linguistics in th...
Unambiguous automata are used to prove B. Tilson's result that the intersection of free submonoids o...
This thesis considers notions of recognisability for languages over (universal) algebras. The main m...
monoidal categories are a natural setting to study automata automata based on actions, languages are...
AbstractWe view CCS terms as defining nondeterministic automata. An algebraic representation of auto...
We propose a notion of morphisms between tree automata based on game semantics. Morphisms are winnin...
International audienceWe propose a notion of morphisms between tree automata based on game semantics...
In a category-theoretic treatment of automata, one is sometimes lead to consider various transcripti...
AbstractA matrix characterization is obtained for the epimorphisms in the category of finitely gener...
We extend the treatment of algebra automata to automata employing algebras over arbitrary theories. ...
AbstractA matrix characterization is obtained for the epimorphisms in the category of finitely gener...
We extend the treatment of algebra automata to automata employing algebras over arbitrary theories. ...
Content in the UH Research Archive is made available for personal research, educational, and non-com...
For alphabets Delta_1, Delta_2, a morphism g : Delta_1* to Delta_2* is ambiguous with respect to a w...
Eilenberg has shown that the notion of varieties in semigroups/monoids can be naturally made to cor...
This paper is a summary of my seminars given in the Research Group on Mathematical Linguistics in th...
Unambiguous automata are used to prove B. Tilson's result that the intersection of free submonoids o...
This thesis considers notions of recognisability for languages over (universal) algebras. The main m...
monoidal categories are a natural setting to study automata automata based on actions, languages are...
AbstractWe view CCS terms as defining nondeterministic automata. An algebraic representation of auto...
We propose a notion of morphisms between tree automata based on game semantics. Morphisms are winnin...
International audienceWe propose a notion of morphisms between tree automata based on game semantics...
DOI
Add to ORKG