Related papers: Path category for free - Open morphisms from coalg…
Computation is classically studied in terms of automata, formal languages and algorithms; yet, the relation between neural dynamics and symbolic representations and operations is still unclear in traditional eliminative connectionism.…
We present a process algebra aimed at describing interactions that are multiparty, i.e. that may involve more than two processes and that are open, i.e. the number of the processes they involve is not fixed or known a priori. Here we focus…
Students find their first course in Formal Languages and Automata Theory challenging. In addition to the development of formal arguments, most students struggle to understand nondeterministic computation models. In part, the struggle stems…
Higher-dimensional automata (HDAs) are models of non-interleaving concurrency for analyzing concurrent systems. There is a rich literature that deals with bisimulations for concurrent systems, and some of them have been extended to HDAs.…
Given a suitable functor T:C -> D between model categories, we define a long exact sequence relating the homotopy groups of any X in C with those of TX, and use this to describe an obstruction theory for lifting an object G in D to C.…
The purpose of this paper is to build a new bridge between category theory and a generalized probability theory known as noncommutative probability or quantum probability, which was originated as a mathematical framework for quantum theory,…
We propose a reformulation of some results known on the free dendriform dialgebra on one generator from a parenthesis point of view. This turns out to be more tractable and point out a connection to free probability by identifying…
In this paper we introduced an algebraic semantics for process algebra in form of abstract data types. For that purpose, we developed a particular type of algebra, the seed algebra, which describes exactly the behavior of a process within a…
In this paper, a connection between bi-free probability and the theory of non-commutative stochastic processes is examined. Specifically it is demonstrated that the transition operators for non-commutative stochastic processes can be…
Motivated by classical notions of partial convexity, biconvexity, and bilinear matrix inequalities, we investigate the theory of free sets that are defined by (low degree) noncommutative matrix polynomials with constrained terms. Given a…
We introduce tree stack automata as a new class of automata with storage and identify a restricted form of tree stack automata that recognises exactly the multiple context-free languages.
The circle transfer $Q\Sigma (LX_{hS^1})_+ \to QLX_+$ has appeared in several contexts in topology. In this note we observe that this map admits a geometric re-interpretation as a morphism of cobordism categories of 0-manifolds and…
The category of presheaves on a (small) category is a suitable semantic universe to study behaviour of various dynamical systems. In particular, presheaves can be used to record the executions of a system and their morphisms correspond to…
It is proved that MacLane's coherence results for monoidal and symmetric monoidal categories can be extended to some other categories with multiplication; namely, to relevant, affine and cartesian categories. All results are formulated in…
In this paper we consider a nondeterministic computation by deterministic multi-head 2-way automata having a read-only access to an auxiliary memory. The memory contains additional data (a guess) and computation is successful iff it is…
The goal of this paper is to set up an obstruction theory in the context of algebras over an operad and in the framework of differential graded modules over a field. Precisely, the problem we consider is the following: Suppose given two…
An n-category is some sort of algebraic structure consisting of objects, morphisms between objects, 2-morphisms between morphisms, and so on up to n-morphisms, together with various ways of composing them. We survey various concepts of…
In a recent paper [3], the authors introduced a map $\mathcal{F}$ which associates a Deitmar scheme (which is defined over the field with one element, denoted by $\mathbb{F}_1$) with any given graph $\Gamma$. By base extension, a scheme…
In this paper we present a framework for modelling \emph{reward-sensitive bisimulations}, that is, bisimulations that account for quantitative differences such as accumulated rewards. To capture both qualitative and quantitative aspects…
We investigate the transition monoid construction for deterministic automata in a categorical setting and establish it as an adjunction. We pair this adjunction with two other adjunctions to obtain two endofunctors on deterministic…