Related papers: Completeness for categories of generalized automat…
Conformance testing of automata is about checking the equivalence of a known specification and a black-box implementation. An important notion in conformance testing is that of a complete test suite, which guarantees that if an…
We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves…
Let ${\mathcal E}$ be a Frobenius category, ${\mathcal P}$ its subcategory of projective objects and $F:{\mathcal E} \to {\mathcal E}$ an exact automorphism. We prove that there is a fully faithful functor from the orbit category ${\mathcal…
In previous work ("From signatures to monads in UniMath"), we described a category-theoretic construction of abstract syntax from a signature, mechanized in the UniMath library based on the Coq proof assistant. In the present work, we…
Suppose $G$ is a finite group. In this paper, we construct an equivalence between the $\infty$-category of algebras over an $N_{\infty}$-operad $\mathcal{O}$ associated to a $G$-indexing system $\mathcal{I}$ and the corresponding…
We study bicategories of (deterministic) automata, drawing from prior work of Katis-Sabadini-Walters, and Di Lavore-Gianola-Rom\'an-Sabadini-Soboci\'nski, and linking their bicategories of `processes' to a bicategory of Mealy machines…
We give an alternate conception of string diagrams as labeled 1-dimensional oriented cobordisms, the operad of which we denote by Cob/O, where O is the set of string labels. The axioms of traced (symmetric monoidal) categories are fully…
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…
Originally introduced in the context of the algebraic approach to term graph rewriting, the notion of gs-monoidal category has surfaced a few times under different monikers in the last decades. They can be thought of as symmetric monoidal…
When formalizing mathematics in (generalized predicative) constructive type theories, or more practically in proof assistants such as Coq or Agda, one is often using setoids (types with explicit equivalence relations). In this note we…
Let $\mathcal{A}$ be a locally bounded $k$-category and $G$ a torsion-free group of $k$-linear automorphisms of $\mathcal{A}$ acting freely on the objects of $\mathcal{A},$ and $F:\mathcal{A}\rightarrow \mathcal{B}$ is a Galois functor. We…
For an endofunctor $F\colon\mathcal{C}\to\mathcal{C}$ on an ($\infty$-)category $\mathcal{C}$ we define the $\infty$-category $\operatorname{Cart}(\mathcal{C},F)$ of generalized Cartier modules as the lax equalizer of $F$ and the identity.…
Span categories provide an abstract framework for formalizing mathematical models of certain systems. The mathematical descriptions of some systems, such as classical mechanical systems, require categories that do not have pullbacks, and…
We consider blind, deterministic, finite automata equipped with a register which stores an element of a given monoid, and which is modified by right multiplication by monoid elements. We show that, for monoids M drawn from a large class…
We describe the Segal $K$-theory of the symmetric monoidal category of finite-dimensional vector spaces over a perfect field $\mathbb{F}$ together with an automorphism, or, equivalently, the group-completion of the $E_\infty$-algebra of…
The category of I-spaces is the diagram category of spaces indexed by finite sets and injections. This is a symmetric monoidal category whose commutative monoids model all E-infinity spaces. Working in the category of I-spaces enables us to…
Hypergraph categories are symmetric monoidal categories where each object is equipped with a special commutative Frobenius algebra (SCFA). Dagger-hypergraph categories are the same, but with dagger-symmetric monoidal categories and…
In [KW14], the new concept of Feynman categories was introduced to simplify the discussion of operad--like objects. In this present paper, we demonstrate the usefulness of this approach, by introducing the concept of decorated Feynman…
We define a new subclass of nondeterministic finite automata for prefix-closed languages called Flanked Finite Automata (FFA). We show that this class enjoys good complexity properties while preserving the succinctness of nondeterministic…
We extend some classical results of Bousfield on homology localizations and nilpotent completions to a presentably symmetric monoidal stable $\infty$-category $\mathscr{M}$ admitting a multiplicative left-complete $t$-structure. If $E$ is a…