Related papers: Orbit Expandability of Automaton Semigroups and Gr…
In this paper, we introduce a family of residually finite groups that helps us to systematically study the residual finiteness growth function (RFG) from various perspectives. First, by strengthening results of Bou-Rabee and Seward and also…
A locally testable language L is a language with the property that for some non negative integer k, called the order of local testability, whether or not a word u is in the language L depends on (1) the prefix and suffix of the word u of…
An infinite word is S-automatic if, for all n>=0, its (n + 1)st letter is the output of a deterministic automaton fed with the representation of n in the considered numeration system S. In this extended abstract, we consider an analogous…
This paper studies a version of the counting problem in dynamical systems that is of interest, especially in conformal dynamical systems where the functions of the systems are angle preserving. Recently, M. Pollicott and M. Urba\'{n}ski…
We consider decision problems for relations over finite and infinite words defined by finite automata. We prove that the equivalence problem for binary deterministic rational relations over infinite words is undecidable in contrast to the…
A finite word $u$ is called closed if its longest repeated prefix has exactly two occurrences in $u,$ once as a prefix and once as a suffix. We study the function $f_x^c:\mathbb N \rightarrow \mathbb N$ which counts the number of closed…
We conjecture that satellite operations are either constant or have infinite rank in the concordance group. We reduce this to the difficult case of winding number zero satellites, and use $SO(3)$ gauge theory to provide a general criterion…
Given an infinite word X over an alphabet A a letter b occurring in X, and a total order \sigma on A, we call the smallest word with respect to \sigma starting with b in the shift orbit closure of X an extremal word of X. In this paper we…
Given a finite alphabet $\mathbb{A}$ and a primitive substitution $\theta:\mathbb{A}\to\mathbb{A}^\lambda$ (of constant length $\lambda$), let $(X_\theta,S)$ denote the corresponding dynamical system, where $X_{\theta}$ is the closure of…
We introduce the notions of topological entropy of a formal language and of a topological automaton. We show that the entropy function is surjective and bound the entropy of languages accepted by deterministic {\epsilon}-free push-down…
Let $k$ be the algebraic closure of a finite field, $G$ a Chevalley group over $k$, $U$ the maximal unipotent subgroup of $G$. To each orthogonal subset $D$ of the root system of the group $G$ and each set $\xi$ of $|D|$ non-zero scalars…
It has been known since the 60's that any complete discrete $n$-state automaton admits a reset word of length not exceeding $\alpha n^3+o(n^3)$ for some absolute constant $\alpha$. J.-E. Pin and P. Frankl proved this statement with…
A notion of alternating timed automata is proposed. It is shown that such automata with only one clock have decidable emptiness problem over finite words. This gives a new class of timed languages which is closed under boolean operations…
We prove that the full automorphism group and the outer automorphism group of the free group of countably infinite rank are coarsely bounded. That is, these groups admit no continuous actions on a metric space with unbounded orbits, and…
Few years ago G\u{a}vru\c{t}a gave the notions of $K$-frame and atomic system for a linear bounded operator $K$ in a Hilbert space $\mathcal{H}$ in order to decompose $\mathcal{R}(K)$, the range of $K$, with a frame-like expansion. These…
The paper explores combinatorial properties of Fibonacci words and their generalizations within the framework of combinatorics on words. These infinite sequences, measures the diversity of subwords in Fibonacci words, showing non-decreasing…
We consider two basic problems of algebraic topology, the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity. The extension problem is the following: Given…
We introduce and study the repetitive variants of the deterministic and the nondeterministic finite automaton with translucent words (DFAwtw and NFAwtw). On seeing the right sentinel, a repetitive NFAwtw need not halt immediately, accepting…
We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves…
The word position automaton was introduced by Glushkov and McNaughton in the early 1960. This automaton is homogeneous and has (||\E||+1) states for a word expression of alphabetic width ||\E||. This kind of automata is extended to regular…