Related papers: Partial actions and automata
We present a method to prove the decidability of provability in several well-known inference systems. This method generalizes both cut-elimination and the construction of an automaton recognizing the provable propositions.
Every automaton can be decomposed into a cascade of basic prime automata. This is the Prime Decomposition Theorem by Krohn and Rhodes. Guided by this theory, we propose automata cascades as a structured, modular, way to describe automata as…
We introduce the notion of multipass automata as a generalization of pushdown automata and study the classes of languages accepted by such machines. The class of languages accepted by deterministic multipass automata is exactly the Boolean…
We extend the notions of nonautonomous dynamics to arbitrary groups, through groupoid morphisms. This also presents a generalization of classic dynamical systems and group actions. We introduce the structure of cotranslations, as a specific…
We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore et al. based on minimal forbidden words. We extend this…
We introduce a novel framework for simulating finite automata using representation-theoretic semidirect products and Fourier modules, achieving more efficient Transformer-based implementations.
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
We introduce first order alternating automata, a generalization of boolean alternating automata, in which transition rules are described by multisorted first order formulae, with states and internal variables given by uninterpreted…
In this work we use a framework of finite-state automata constructions based on equivalences over words to provide new insights on the relation between well-known methods for computing the minimal deterministic automaton of a language.
Based mainly on examples of interest in mechanics, we define the notion of a polite group action. One may view this as not only trying to give a more general notion than properness of a group action, but also to more fully understand the…
We show how the categorial approach to inverse monoids can be described as a certain endofunctor (which we call the partialization functor) of some category. In this paper we show that this functor can be used to obtain several recently…
We present here a construction for the derived term automaton (aka partial derivative, or Antimirov, automaton) of a rational (or regular) expression based on a sole induction on the depth of the expression and without making reference to…
Given an $\omega$-automaton and a set of substitutions, we look at which accepted words can also be defined through these substitutions, and in particular if there is at least one. We introduce a method using desubstitution of…
We introduce partial semigroupoid actions on sets and demonstrate that each such action admits universal globalization. Our construction extends the universal globalization for partial category actions given by P. Nystedt (Lundstr\"om) and…
In this paper we introduce the definition of partial action on small $k$-categories generalizing the similar well known notion of partial actions on algebras. The point of view of partial action which we use in this paper is the one which…
We define a notion which contains numerous basic notions of Analysis as special cases, for example limit, continuity, differential, Riemann and Lebesgue integral, root and exponential functions. Properties like additivity or linearity of…
In this work, we define a framework of automata constructions based on quasiorders over words to provide new insights on the class of residual automata. We present a new residualization operation and a generalized double-reversal method for…
We introduce DragAPart, a method that, given an image and a set of drags as input, generates a new image of the same object that responds to the action of the drags. Differently from prior works that focused on repositioning objects,…
We extend the functorial approach to automata by Colcombet and Petri\c{s}an [arXiv:1712.07121] from the category of sets to any elementary topos with a natural number object and establish general Myhill-Nerode theorems in our setting. As a…
Let $X$ be a compact Hausdorff space. In this work we translate partial actions of $X$ to partial actions on some hyperspaces determined by $X,$ this gives an endofunctor $2^{-}$ in the category of partial actions on compact Hausdorff…