Add to ORKGBecause of the isomorphism (X x A) -> X = X -> (A -> X), the transition structure t: X -> (A -> X) of a deterministic automaton with state set X and with inputs from an alphabet A can be viewed both as an algebra and as a coalgebra. Here we will use this algebra-coalgebra duality of automata as a common perspective for the study of equations and coequations. Equations are sets of pairs of words (v,w) tha
In this paper we show duality results between categories of equations and categories of coequations....
The main goal in this paper is to use a dual equivalence in automata theory started in [25] and deve...
Contains fulltext : 147286.pdf (preprint version ) (Open Access
htmlabstractBecause of the isomorphism (X x A) -> X = X -> (A -> X), the transition structure t...
AbstractBecause of the isomorphism (X×A)→X≅X→(A→X), the transition structure of a deterministic auto...
Because of the isomorphism (X × A) → X ∼ = X → (A → X), the transition structure of a deterministic...
AbstractBecause of the isomorphism (X×A)→X≅X→(A→X), the transition structure of a deterministic auto...
In this paper we use a duality result between equations and coequations for automata, proved by Ball...
In this paper we use a duality result between equations and coequations for automata, proved by Ball...
International audienceIn this paper we show duality results between categories of equations and cate...
International audienceIn this paper we show duality results between categories of equations and cate...
International audienceIn this paper we show duality results between categories of equations and cate...
International audienceIn this paper we show duality results between categories of equations and cate...
The main goal in this paper is to use a dual equivalence in automata theory started in [25] and deve...
textabstractIn this paper we show duality results between categories of equations and categories of ...
In this paper we show duality results between categories of equations and categories of coequations....
The main goal in this paper is to use a dual equivalence in automata theory started in [25] and deve...
Contains fulltext : 147286.pdf (preprint version ) (Open Access
htmlabstractBecause of the isomorphism (X x A) -> X = X -> (A -> X), the transition structure t...
AbstractBecause of the isomorphism (X×A)→X≅X→(A→X), the transition structure of a deterministic auto...
Because of the isomorphism (X × A) → X ∼ = X → (A → X), the transition structure of a deterministic...
AbstractBecause of the isomorphism (X×A)→X≅X→(A→X), the transition structure of a deterministic auto...
In this paper we use a duality result between equations and coequations for automata, proved by Ball...
In this paper we use a duality result between equations and coequations for automata, proved by Ball...
International audienceIn this paper we show duality results between categories of equations and cate...
International audienceIn this paper we show duality results between categories of equations and cate...
International audienceIn this paper we show duality results between categories of equations and cate...
International audienceIn this paper we show duality results between categories of equations and cate...
The main goal in this paper is to use a dual equivalence in automata theory started in [25] and deve...
textabstractIn this paper we show duality results between categories of equations and categories of ...
In this paper we show duality results between categories of equations and categories of coequations....
The main goal in this paper is to use a dual equivalence in automata theory started in [25] and deve...
Contains fulltext : 147286.pdf (preprint version ) (Open Access