Related papers: Path category for free - Open morphisms from coalg…
Given any category $\mathcal{C}$ with pullbacks and a terminal object, we show that the data consisting of the objects of $\mathcal{C}$, the spans of $\mathcal{C}$, and the isomorphism classes of spans of spans of $\mathcal{C}$, forms a…
A continuous family of non-outer conjugate aperiodic automorphisms whose crossed-products are all isomorphic is given on every interpolated free group factor. An explicit "duality" relationship between compact co-commutative Kac algebra…
Automata learning is a technique that has successfully been applied in verification, with the automaton type varying depending on the application domain. Adaptations of automata learning algorithms for increasingly complex types of automata…
Categorification is the process of finding category-theoretic analogs of set-theoretic concepts by replacing sets with categories, functions with functors, and equations between functions by natural isomorphisms between functors, which in…
We construct generalized multicategories associated to an arbitrary operad in Cat that is $\Sigma$-free. The construction generalizes the passage to symmetric multicategories from permutative categories, which is the case when the operad is…
Dynamical systems are a broad class of mathematical tools used to describe the evolution of physical and computational processes. Traditionally these processes model changing entities in a static world. Picture a ball rolling on an empty…
Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as…
Aczel-Mendler bisimulations are a coalgebraic extension of a variety of computational relations between systems. It is usual to assume that the underlying category satisfies some form of the axiom of choice, so that the collection of…
Implicit computational complexity, which aims at characterizing complexity classes by machine-independent means, has traditionally been based, on the one hand, on programs and deductive formalisms for free algebras, and on the other hand on…
We show that for any compact Lie group $G$ with identity component $N$ and component group $W=G/N$, the category of free rational $G$-spectra is equivalent to the category of torsion modules over the twisted group ring $H^*(BN)[W]$. This…
Often in Software Engineering, a modeling formalism has to support scenarios of inconsistency in which several requirements either reinforce or contradict each other. Paraconsistent transition systems are proposed in this paper as one such…
The strict globular $\omega$-categories formalize the execution paths of a parallel automaton and the homotopies between them. One associates to such (and any) $\omega$-category $\C$ three homology theories. The first one is called the…
While many applications of automata in formal methods can use nondeterministic automata, some applications, most notably synthesis, need deterministic or good-for-games (GFG) automata. The latter are nondeterministic automata that can…
A process algebra is proposed, whose semantics maps a term to a nondeterministic finite automaton (NFA, for short). We prove a representability theorem: for each NFA $N$, there exists a process algebraic term $p$ such that its semantics is…
Relational structures are emerging as ubiquitous mathematical machinery in the semantics of open systems of various kinds. Cartesian bicategories are a well-known categorical algebra of relations that has proved especially useful in recent…
We construct a many-object dual version of Chen's iterated integral map. For any topological space X, the construction takes the form of an A-infinity functor between two dg categories whose objects are the points of X: the domain has as…
We consider all Bott-Samelson varieties ${\rm BS}(s)$ for a fixed connected semisimple complex algebraic group with maximal torus $T$ as the class of objects of some category. The class of morphisms of this category is an extension of the…
We study increasingly expressive type systems, from $F^\mu$ -- an extension of the polymorphic lambda calculus with equirecursive types -- to $F^{\mu;}_\omega$ -- the higher-order polymorphic lambda calculus with equirecursive types and…
Coalgebra is a currently quite active field, which aims to look at generic state-based systems (most prominently automata) from a very abstract point of view, mainly using tools from category theory. One of its achievements is to give a…
Let V be a variety of algebras of some type. An interest to describing automorphisms of the category C of finitely generated free V-algebras was inspired in connection with development of universal algebraic geometry founded by B. Plotkin.…