Related papers: Aperiodic two-way transducers and FO-transductions
This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation…
The notion of transducer integer sequences is considered through a series of examples. By definition, transducer integer sequences are integer sequences produced, under a suitable interpretation, by finite automata encoding tree morphisms…
We present a comprehensive mechanism for the emergence of rotational horseshoes and strange attractors in a class of two-parameter families of periodically-perturbed differential equations defining a flow on a three-dimensional manifold.…
A fixed point theorem is proved for inverse transducers, leading to an automata-theoretic proof of the fixed point subgroup of an endomorphism of a finitely generated virtually free group being finitely generated. If the endomorphism is…
It is proved that the periodic point submonoid of a free inverse monoid endomorphism is always finitely generated. Using Chomsky's hierarchy of languages, we prove that the fixed point submonoid of an endomorphism of a free inverse monoid…
Regular languages -- the languages accepted by deterministic finite automata -- are known to be precisely the languages recognized by finite monoids. This characterization is the origin of algebraic language theory. In this paper, we…
We study the relation between the standard two-way automata and more powerful devices, namely, two-way finite automata with an additional "pebble" movable along the input tape. Similarly as in the case of the classical two-way machines, it…
An S-adic expansion of an infinite word is a way of writing it as the limit of an infinite product of substitutions (i.e., morphisms of a free monoid). Such a description is related to continued fraction expansions of numbers and vectors. A…
In this article, novel deterministic equivalents for the Stieltjes transform and the Shannon transform of a class of large dimensional random matrices are provided. These results are used to characterise the ergodic rate region of multiple…
We provide a complete characterisation of automaticity of uniformly recurrent substitutive sequences in terms of the incidence matrix of the return substitution of the underlying purely substitutive sequence. This resolves a recent question…
We develop an algebraic notion of recognizability for languages of words indexed by countable linear orderings. We prove that this notion is effectively equivalent to definability in monadic second-order (MSO) logic. We also provide three…
Bojanczyk and Pilipczuk showed in their celebrated article "Definability equals recognizability for graphs of bounded treewidth" (LICS 2016) that monadic second-order logic can define tree-decompositions in graphs of bounded treewidth. This…
We develop the holographic formulation of transport in strongly coupled two-layer systems. We identify a dc conductivity, sigma^dc, that is finite even in a translationally invariant setup, and universal for CFTs with a gravity dual. The…
We define a class of languages of infinite words over infinite alphabets, and the corresponding automata. The automata used for recognition are a generalisation of deterministic Muller automata to the setting of nominal sets. Remarkably,…
Deterministic two-way transducers define the class of regular functions from words to words. Alur and Cern\'y introduced an equivalent model of transducers with registers called copyless streaming string transducers. In this paper, we drop…
It was shown recently that the f-diagonal tensor in the T-SVD factorization must satisfy some special properties. Such f-diagonal tensors are called s-diagonal tensors. In this paper, we show that such a discussion can be extended to any…
We study various aspects of the first-order transduction quasi-order on graph classes, which provides a way of measuring the relative complexity of graph classes based on whether one can encode the other using a formula of first-order (FO)…
We show that every two-way deterministic finite automaton (2DFA) that solves one-way liveness on height h has Omega(h^2) states. This implies a quadratic lower bound for converting one-way nondeterministic finite automata to 2DFAs, which…
Floyd languages (FL), alias Operator Precedence Languages, have recently received renewed attention thanks to their closure properties and local parsability which allow one to apply automatic verification techniques (e.g. model checking)…
We study Translation functors and Wall-Crossing functors on infinite dimensional representations of a complex semisimple Lie algebra using D-modules. This functorial machinery is then used to prove the Endomorphism-theorem and the…