Related papers: Cerny type automata and rank conjecture
In this paper we study the cyclic inverse monoid $\CI_n$ on a set $\Omega_n$ with $n$ elements, i.e. the inverse submonoid of the symmetric inverse monoid on $\Omega_n$ consisting of all restrictions of the elements of a cyclic subgroup of…
This paper presents a framework based on matrices of monoids for the study of coupled cell networks. We formally prove within the proposed framework, that the set of results about invariant synchrony patterns for unweighted networks also…
We study trees where each successor set is equipped with some additional structure. We introduce a family of automaton models for such trees and prove their equivalence to certain fixed-point logics. As a consequence we obtain…
The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be transformed into the trivial presentation by a finite sequence of "elementary transformations" which are Nielsen transformations together with…
A word $w$ of letters on edges of underlying graph $\Gamma$ of deterministic finite automaton (DFA) is called synchronizing if $w$ sends all states of the automaton to a unique state. J. \v{C}erny discovered in 1964 a sequence of $n$-state…
In this paper, we first study the conversion of weighted two-way automata to one-way automata. We show that this conversion preserves the unambiguity but does not preserve the determinism. Yet, we prove that the conversion of an unambiguous…
In 1998 G. Valent made conjectures about the order and type of certain indeterminate Stieltjes moment problems associated with birth and death processes having polynomial birth and death rates of degree p\ge 3. Romanov recently proved that…
Eklund et al. (2002) present a graphical technique aimed at simplifying the verification of various category-theoretic constructions, notably the composition of monads. In this note we take a different approach involving string rewriting.…
Eilenberg correspondence, based on the concept of syntactic monoids, relates varieties of regular languages with pseudovarieties of finite monoids. Various modifications of this correspondence related more general classes of regular…
We show that a recent definition of relative R\'enyi entropy is monotone under completely positive, trace preserving maps. This proves a recent conjecture of M\"uller-Lennert et al.
The well-known Nerode equivalence for finite words plays a fundamental role in our understanding of the class of regular languages. The equivalence leads to the Myhill-Nerode theorem and a canonical automaton, which in turn, is the basis of…
Strassen's asymptotic rank conjecture [Progr. Math. 120 (1994)] claims a strong submultiplicative upper bound on the rank of a three-tensor obtained as an iterated Kronecker product of a constant-size base tensor. The conjecture, if true,…
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…
We study the interaction between two structures on the group of polynomial automorphisms of the affine plane: its structure as an amalgamated free product and as an infinite-dimensional algebraic variety. We introduce a new conjecture, and…
Convex rank tests are partitions of the symmetric group which have desirable geometric properties. The statistical tests defined by such partitions involve counting all permutations in the equivalence classes. Each class consists of the…
This paper proposes a definition of recognizable transducers over monads and comonads, which bridges two important ongoing efforts in the current research on regularity. The first effort is the study of regular transductions, which extends…
We prove that a suitably de-biased version of Chatterjee's rank correlation based on i.i.d. copies of a random vector $(X,Y)$ is asymptotically normal whenever $Y$ is not almost surely constant. No further conditions on the joint…
Valence automata are a generalization of various models of automata with storage. Here, each edge carries, in addition to an input word, an element of a monoid. A computation is considered valid if multiplying the monoid elements on the…
A monoid $M$ is called surjunctive if every injective cellular automata with finite alphabet over $M$ is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all…
Let $A$ be a separable, unital, simple C*-algebra with stable rank one. We show that every strictly positive, lower semicontinuous, affine function on the simplex of normalized quasitraces of $A$ is realized as the rank of an operator in…