Related papers: Completeness for categories of generalized automat…

The axioms of iteration theories, or iteration categories, capture the equational properties of fixed point operations in several computationally significant categories. Iteration categories may be axiomatized by the Conway identities and…

This paper presents the first step of a wider research effort to apply tree automata completion to the static analysis of functional programs. Tree Automata Completion is a family of techniques for computing or approximating the set of…

We show that for every countable recursively saturated model $M$ of Peano Arithmetic and every subset $A \subseteq M$, there exists a full satisfaction class $S_A \subset M^2$ such that $A$ is definable in $(M,S_A)$ without parametres. It…

We study generalized automata (in the sense of Ad\'amek-Trnkov\'a) in Joyal's category of (set-valued) combinatorial species, and as an important preliminary step, we study coalgebras for its derivative endofunctor $\partial$ and for the…

In this article we develop formal category theory within augmented virtual double categories. Notably we formalise the classical notions of Kan extension, Yoneda embedding $\text y_A\colon A \to \hat A$, exact square, total category and…

Let A be a dg category, F:A->A a dg functor inducing an equivalence of categories in degree-zero cohomology, and A/F the associated dg orbit category. For every A1-homotopy invariant (e.g. homotopy K-theory, K-theory with coefficients,…

We consider two-variable first-order logic $\text{FO}^2$ and its quantifier alternation hierarchies over both finite and infinite words. Our main results are forbidden patterns for deterministic automata (finite words) and for Carton-Michel…

A central question in equivariant algebraic K-theory asks whether there exists an equivariant K-theory machine from genuine symmetric monoidal G-categories to orthogonal G-spectra that preserves equivariant algebraic structures. We answer…

Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…

This paper presents efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with $\epsilon$-transitions. It gives an algorithm for testing the exponential ambiguity of an automaton $A$ in time…

We extend the two-variable logic on data words with guarded regular binary predicates of the form $\widetilde{L}(x,y)$ that is true if positions $x$ and $y$ are in the same class and the factor strictly between $x$ and $y$ is in the regular…

Given an $\infty$-category $C$ equipped with suitable wide subcategories $I, P \subset E\subset C$, we show that the $(\infty,2)$-category $\text{S}{\scriptstyle\text{PAN}}_2(C,E)_{P,I}$ of higher (or iterated) spans defined by Haugseng has…

We extend the classical notion of a Reedy category so as to allow non-trivial automorphisms. Our extension includes many important examples occuring in topology such as Segal's category Gamma, or the total category of a crossed simplicial…

Using generalized enriched categories, in this paper we show that Rosick\'{y}'s proof of cartesian closedness of the exact completion of the category of topological spaces can be extended to a wide range of topological categories over…

There are different categorical approaches to variations of transition systems and their bisimulations. One is coalgebra for a functor G, where a bisimulation is defined as a span of G-coalgebra homomorphism. Another one is in terms of path…

Birget, Margolis, Meakin and Weil proved that a finitely generated subgroup $K$ of a free group is pure if and only if the transition monoid $M(K)$ of its Stallings automaton is aperiodic. In this paper, we establish further connections…

Generalizing F-nilpotent completion for a ring spectrum F we first define the notion of completion with respect to a thick subcategory in a monogenic stable homotopy category. Specializing this to the thick subcategory generated by…

We describe an inductive machinery to prove various properties of representations of a category equipped with a generic shift functor. Specifically, we show that if a property (P) of representations of the category behaves well under the…

We give an elementary construction of the exact completion of a weakly lex category for categories enriched in the cartesian closed category $\mathsf{Pos}$ of partially ordered sets. Paralleling the ordinary case, we characterize categories…

Without the axiom of choice, the free exact completion of the category of sets (i.e. the category of setoids) may not be complete or cocomplete. We will show that nevertheless, it can be enhanced to a derivator: the formal structure of…