On extensions of functors to the Kleisli category
On minimal realizations of behavior maps in categorial automata theory
On quasi-homomorphisms and compositions of automata
On the exact completion of the homotopy category
On the geometry of computations
On the homology of small categories and asynchronous transition systems.
On the relations between abstract and geometrical equivalence of abstract objects
One dimensional dynamics and factors of finite automata
One More Categorical Model of Universal Algebra.
Opérations sur les cartes et métamorphoses de la catégorie des G-ensembles.
We call metamorphosis of a given category an autoequivalence functor up to within natural equivalence. We show that, given a group G, the group of metamorphoses of the category of G-sets (as well as the corresponding group for ?sufficiently big? subcategories) may be naturally identified to the group of outer automorphism of G. We get by this way a natural description of a group of known operations on tessellations of a surface: the identity operation, the Poincaré duality, and four others which...
Ordinal invariants and epimorphisms in some categories of weak Hausdorff spaces
Remarques sur les machines et les structures
Simulations of Pawlak machines as fuzzy morphisms of partial algebras
Sui sottouniversi normali di un universo di dispositivi lineari su un corpo
-algebras of the monad -Fuzz
Tenseurs et machines
Tensor product of partially-additive monoids.
The category of Pawlak machines
The compositional construction of Markov processes II
We add sequential operations to the categorical algebra of weighted and Markov automata introduced in [L. de Francesco Albasini, N. Sabadini and R.F.C. Walters, arXiv:0909.4136]. The extra expressiveness of the algebra permits the description of hierarchical systems, and ones with evolving geometry. We make a comparison with the probabilistic automata of Lynch et al. [SIAM J. Comput. 37 (2007) 977–1013].
The compositional construction of Markov processes II
We add sequential operations to the categorical algebra of weighted and Markov automata introduced in [L. de Francesco Albasini, N. Sabadini and R.F.C. Walters, arXiv:0909.4136]. The extra expressiveness of the algebra permits the description of hierarchical systems, and ones with evolving geometry. We make a comparison with the probabilistic automata of Lynch et al. [SIAM J. Comput.37 (2007) 977–1013].