English
Related papers

Related papers: Completeness for categories of generalized automat…

200 papers

On a category $\mathscr{C}$ with a designated (well-behaved) class $\mathcal{M}$ of monomorphisms, a closure operator in the sense of D. Dikranjan and E. Giuli is a pointed endofunctor of $\mathcal{M}$, seen as a full subcategory of the…

Category Theory · Mathematics 2017-04-20 Mathieu Duckerts-Antoine , Marino Gran , Zurab Janelidze

We develop a rigidity criterion to show that in simplicial model categories with a compatible symmetric monoidal structure, operad structures can be automatically lifted along certain maps. This is applied to obtain an unpublished result of…

Algebraic Topology · Mathematics 2014-11-11 Daniel G. Davis , Tyler Lawson

We define the class of explorable automata on finite or infinite words. This is a generalization of History-Deterministic (HD) automata, where this time non-deterministic choices can be resolved by building finitely many simultaneous runs…

Formal Languages and Automata Theory · Computer Science 2025-11-26 Emile Hazard , Olivier Idir , Denis Kuperberg

We study monads in the (pseudo-)double category $\mathbf{KSW}(\mathcal{K})$ where loose arrows are Mealy automata valued in an ambient monoidal category $\mathcal{K}$, and the category of tight arrows is $\mathcal{K}$. Such monads turn out…

Category Theory · Mathematics 2025-01-06 Fosco Loregian

A two-dimensional finite automaton has a read-only input head that moves in four directions on a finite array of cells labelled by symbols of the input alphabet. A three-way two-dimensional automaton is prohibited from making upward moves,…

Formal Languages and Automata Theory · Computer Science 2019-04-26 Taylor J. Smith , Kai Salomaa

An operator set is functionally incomplete if it can not represent the full set $\lbrace \neg,\vee,\wedge,\rightarrow,\leftrightarrow\rbrace$. The verification for the functional incompleteness highly relies on constructive proofs. The…

Logic · Mathematics 2020-05-12 Yang Tian

In this note we provide a characterization, in terms of additional algebraic structure, of those intervals (certain cocategory objects) in a symmetric monoidal closed category E that are representable in the sense of inducing on E the…

Category Theory · Mathematics 2012-05-25 Michael A. Warren

The regular objects in various categories, such as maps, hypermaps or covering spaces, can be identified with the normal subgroups N of a given group \Gamma, with quotient group isomorphic to \Gamma/N. It is shown how to enumerate such…

Combinatorics · Mathematics 2013-09-25 Gareth A. Jones

Every category $\mathcal K$ has a free completion $\mathcal P \mathcal K$ under colimits and a free completion $\Sigma\mathcal K$ under coproducts. A number of properties of $\mathcal K$ transfer to $\mathcal P \mathcal K$ and…

Category Theory · Mathematics 2020-12-04 Jiří Adámek , Jiří Rosický

We develop the theory of exact completions of regular $\infty$-categories, and show that the $\infty$-categorical exact completion (resp. hypercompletion) of an abelian category recovers the connective half of its bounded (resp. unbounded)…

Category Theory · Mathematics 2023-10-20 Germán Stefanich

We study categories whose objects are the braid representations, i.e. strict monoidal functors $F\colon B\rightarrow Mat$ from the braid category $B$ to the category of matrices $Mat$. Braid representations are equivalent to solutions to…

Quantum Algebra · Mathematics 2025-09-24 P. P. Martin , E. C. Rowell , F. Torzewska

For a small quantaloid $\mathcal{Q}$, we introduce $\mathcal{M}$-(co)complete $\mathcal{Q}$-categories, i.e., (co)complete $\mathcal{Q}$-categories up to Morita equivalence, as Eilenberg--Moore algebras of the presheaf monad on the category…

Category Theory · Mathematics 2025-11-24 Xiaoye Tang

This paper proposes a generalized framework for cellular automata using the language of category theory, extending the classical definition beyond set-theoretic constraints. For an arbitrary category $\mathscr{C}$ with products, we define…

Formal Languages and Automata Theory · Computer Science 2026-02-05 A. Castillo-Ramirez , A. Vazquez-Aceves , A. Zaldivar-Corichi

We characterize complete deterministic finite automata with two input letters in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word. The characterization leads to a…

Formal Languages and Automata Theory · Computer Science 2022-08-23 David Casas , Mikhail V. Volkov

We construct for every $\infty$-operad $\mathcal{O}^\otimes$ with certain finite limits new $\infty$-operads of spectrum objects and of commutative group objects in $\mathcal{O}$. We show that these are the universal stable resp. additive…

Algebraic Topology · Mathematics 2016-08-10 Thomas Nikolaus

We offer a solution to the long-standing problem of group completing within the context of rig categories (also known as bimonoidal categories). Given a rig category R we construct a natural additive group completion R' that retains the…

K-Theory and Homology · Mathematics 2022-06-22 Nils A. Baas , Bjorn Ian Dundas , Birgit Richter , John Rognes

Let $\&$ be a continuous triangular norm on the unit interval $[0,1]$ and $\mathbf{A}$ be a cartesian closed and stable subconstruct of the category consisting of all real-enriched categories. Firstly, it is shown that the category…

Category Theory · Mathematics 2024-08-15 Hongliang Lai , Qingzhu Luo

We build the wrapped Fukaya category W(E) for any monotone symplectic manifold, convex at infinity. We define the open-closed and closed open-string maps. We study their algebraic properties and prove that the string maps are compatible…

Symplectic Geometry · Mathematics 2016-09-22 Alexander F. Ritter , Ivan Smith

Saturation is a fundamental game-semantic property satisfied by strategies that interpret higher-order concurrent programs. It states that the strategy must be closed under certain rearrangements of moves, and corresponds to the intuition…

Programming Languages · Computer Science 2024-02-14 Alex Dixon , Andrzej S. Murawski

Watts's Theorem says that a right exact functor F:Mod R-->Mod S that commutes with direct sums is isomorphic to -\otimes_R B where B is the R-S-bimodule FR. The main result in this paper is the following: if A is a cocomplete abelian…

Rings and Algebras · Mathematics 2008-06-05 A. Nyman , S. Paul Smith