Related papers: Completeness for categories of generalized automat…

Let $\operatorname{CDG}_{cont}$ be the category whose objects are pairs $(A,\bar{\mathfrak{a}})$, where $A$ is a commutative DG-algebra and $\bar{\mathfrak{a}}\subseteq \mathrm{H}^0(A)$ is a finitely generated ideal, and whose morphisms…

We introduce a logic to express structural properties of automata with string inputs and, possibly, outputs in some monoid. In this logic, the set of predicates talking about the output values is parametric, and we provide sufficient…

We show that the category OS of operator spaces, with complete contractions as morphisms, is locally countably presentable. This result, together with its symmetric monoidal closed structure with respect to the projective tensor product of…

For an exact dg category $\mathcal A$, we introduce its bounded dg derived category $\mathcal{D}^b_{dg}(\mathcal A)$ and establish the universal exact morphism from $\mathcal A$ to $\mathcal{D}^b_{dg}(\mathcal A)$. We prove that the dg…

We show that the regular patterns of Getzler (2009) form a 2-category biequivalent to the 2-category of substitudes of Day and Street (2003), and that the Feynman categories of Kaufmann and Ward (2013) form a 2-category biequivalent to the…

This paper discusses iterated monodromy groups for transcendental functions. We show that for every post-singularly finite entire transcendental function, the iterated monodromy action can be described by bounded activity automata of a…

For a 2-category $\mathcal{K}$, we consider Street's 2-category Mnd($\mathcal{K}$) of monads in $\mathcal{K}$, along with Lack and Street's 2-category EM($\mathcal{K}$) and the identity-on-objects-and-1-cells 2-functor Mnd($\mathcal{K}$)…

In this document, we propose a description, via a Haskell implementation, of a generalization of the notion of regular expression allowing us to group the definitions and the methods of (tree or word) automata constructions over one generic…

The fully enriched μ-calculus is the extension of the propositional μ-calculus with inverse programs, graded modalities, and nominals. While satisfiability in several expressive fragments of the fully enriched μ-calculus is known…

Algorithms which learn environments represented by automata in the past have had complexity scaling with the number of states in the automaton, which can be exponentially large even for automata recognizing regular expressions with a small…

In an abelian category $\mathscr{A}$ with small ${\rm Ext}$ groups, we show that there exists a one-to-one correspondence between any two of the following: balanced pairs, subfunctors $\mathcal{F}$ of ${\rm Ext}^{1}_{\mathscr{A}}(-,-)$ such…

For A a category with finite colimits, we show that the embedding of A into the category of arrows Arr(A) determined by the initial object is the completion of A under strong homotopy cokernels. The nullhomotopy structure of Arr(A) (needed…

In this short note we show that E-infinity quasi-categories can be replaced by strictly commutative objects in the larger category of diagrams of simplicial sets indexed by finite sets and injections. This complements earlier work on…

In this paper, we prove that all automorphisms of categories of free S-acts are semi-inner, which solves a variation of a well known B. Plotkin's problem in the case of monoids. We also give a description of automorphisms of categories of…

We call a tensor functor $F:\mathcal{C}\to\mathcal{D}$ between finite tensor categories $\otimes$-Frobenius if its left and right adjoints are isomorphic as $\mathcal{C}$-bimodule functors. We give several characterizations of this notion…

A group completion functor Q is constructed in the category of algebras in simplicial sets over a cofibrant E_n-operad M. It is shown that Q defines a Bousfield-Friedander simplicial model category on M-algebras.

Certain results involving "higher structures" are not currently accessible to computer formalization because the prerequisite $\infty$-category theory has not been formalized. To support future work on formalizing $\infty$-category theory…

We construct a machine which takes as input a locally small symmetric closed complete multicategory $\mathsf V$. And its output is again a locally small symmetric closed complete multicategory $\mathsf V\text-\mathcal{C}at$, the…

For an atomic orbital base category in the sense of Barwick-Dotto-Glasman-Nardin-Shah, we introduce the category of parametrised perfect-stable categories and use it to construct the parametrised version of noncommutative motives in which…

In this paper we regard languages and their acceptors - such as deterministic or weighted automata, transducers, or monoids - as functors from input categories that specify the type of the languages and of the machines to categories that…