相关论文: Words avoiding reversed subwords

Given a (finite or infinite) subset $X$ of the free monoid $A^*$ over a finite alphabet $A$, the rank of $X$ is the minimal cardinality of a set $F$ such that $X \subseteq F^*$. We say that a submonoid $M$ generated by $k$ elements of $A^*$…

A word is square-free if it does not contain a nonempty word of the form $XX$ as a factor. A famous 1906 result of Thue asserts that there exist arbitrarily long square-free words over a $3$-letter alphabet. We study square-free words with…

A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of…

Let $L_{K}(A)$ be the free Lie algebra on a finite alphabet $A$ over a commutative ring $K$ with unity. For a word $u$ in the free monoid $A^{*}$ let $\tilde{u}$ denote its reversal. Two words in $A^{*}$ are called twin (resp. anti-twin) if…

We prove two results about width of words in $SL_n(\mathbb{Z})$. The first is that, for every $n \geq 3$, there is a constant $C(n)$ such that the width of any word in $SL_n(\mathbb{Z})$ is less than $C(n)$. The second result is that, for…

Suppose that G is a nontrivial torsion-free group and w is a word over the alphabet G\cup\{x_1^{\pm1},...,x_n^{\pm1}\}. It is proved that for n\ge2 the group \~G=<G,x_1,x_2,...,x_n | w=1> always contains a nonabelian free subgroup. For n=1…

We characterize the clustering of a word under the Burrows-Wheeler transform in terms of the resolution of a bounded number of bispecial factors belonging to the language generated by all its powers. We use this criterion to compute, in…

We begin with a new analysis of formal words. Let w be a formal word in letters g_1,...,g_k. The word map associated with w maps the permutations s_1,...,s_k in S_n to the permutation obtained by replacing for each i, every occurrence of…

A factor $u$ of a word $w$ is a cover of $w$ if every position in $w$ lies within some occurrence of $u$ in $w$. A word $w$ covered by $u$ thus generalizes the idea of a repetition, that is, a word composed of exact concatenations of $u$.…

We begin a systematic study of the relations between subword complexity of infinite words and their power avoidance. Among other things, we show that -- the Thue-Morse word has the minimum possible subword complexity over all overlap-free…

To each one-dimensional subshift $X$, we may associate a winning shift $W(X)$ which arises from a combinatorial game played on the language of $X$. Previously it has been studied what properties of $X$ does $W(X)$ inherit. For example, $X$…

An $\epsilon$-test for any non-trivial property (one for which there are both satisfying inputs and inputs of large distance from the property) should use a number of queries that is at least inversely proportional in $\epsilon$. However,…

In this note we provide a (decidable) graph-structural characterisation of the infiniteness of $L(w_1, ..., w_k)$, where $L(w_1, ..., w_k) = \{w \in A^* | |w|_{w_1} = \cdots = |w|_{w_k}\}$ is the set of all words that contain the same…

A finite deterministic (semi)automaton $\mathcal{A} =(Q,\Sigma,\delta)$ is $k$-compressible if there is some word $w\in \Sigma^+$ such that the image of its state set $Q$ under the natural action of $w$ is reduced by at least $k$ states.…

Let $w = [[x^k, y^l], [x^m, y^n]]$ be a non-trivial double commutator word. We show that $w$ is surjective on $\mathrm{PSL}_2(K)$, where $K$ is an algebraically closed field of characteristic $0$.

In this paper, we explore L1-specific non-words, i.e. non-words in a target language (in this case Swedish) that are re-ranked by a different-language language model. We surmise that speakers of a certain L1 will react different to…

Return words are a classical tool for studying shift spaces with low factor complexity. In recent years, their projection inside groups have attracted some attention, for instance in the context of dendric shift spaces, of generation of…

A non-empty word $w$ is a \emph{border} of a word $u$ if $\vert w\vert<\vert u\vert$ and $w$ is both a prefix and a suffix of $u$. A word $u$ is \emph{privileged} if $\vert u\vert\leq 1$ or if $u$ has a privileged border $w$ that appears…

A word is square-free if it does not contain any square (a word of the form $XX$), and is extremal square-free if it cannot be extended to a new square-free word by inserting a single letter at any position. Grytczuk, Kordulewski, and…

Counter automata are more powerful versions of finite-state automata where addition and subtraction operations are permitted on a set of n integer registers, called counters. We show that the word problem of $\Z^n$ is accepted by a…