Related papers: The non-abelian squares are not context-free
We characterize all quasiperiodic Sturmian words: a Sturmian word is not quasiperiodic if and only if it is a Lyndon word. Moreover, we study links between Sturmian morphisms and quasiperiodicity.
An efficient, when compared to exhaustive enumeration, algorithm for computing the number of square-free words of length $n$ over the alphabet $\{a, b, c\}$ is presented.
The Bar-Hillel construction is a classic result in formal language theory. It shows, by a simple construction, that the intersection of a context-free language and a regular language is itself context-free. In the construction, the regular…
Continuing on from recent results of Brumer-Kramer and of Schoof, we show that there exist non-zero semistable Abelian varieties over Z[1/N], with N squarefree, if and only if N is not in the set {1,2,3,5,6,7,10,13}. Our results are…
Stratified formulae were introduced by Quine as an alternative way to attack Russell's Paradox. Instead of limiting comprehension by size (as in $\mathsf{ZF}$ set theory, using its axiom scheme of separation), unlimited comprehension is…
Motivated by the question of which completely regular semigroups have context-free word problem, we show that for certain classes of languages $\mathfrak{C}$(including context-free), every completely regular semigroup that is a union of…
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alphabet exist for all lengths $l$ except for 5, 7, 9, 10, 14,…
We show that if a context-free grammar generates a language whose lexicographic ordering is well-ordered of type less than $\omega^2$, then its order type is effectively computable.
We study the non-abelian tensor square $G\otimes G$ for the class of groups G that are finitely generated modulo their derived subgroup. In particular, we find conditions on G/G' so that $G\otimes G$ is isomorphic to the direct product of…
A finitely generated group or monoid is said to be context-free if it has context-free word problem. In this note, we give an example of a context-free monoid, none of whose maximal subgroups are finitely generated. This answers a question…
We survey known results and open problems in abelian combinatorics on words. Abelian combinatorics on words is the extension to the commutative setting of the classical theory of combinatorics on words. The extension is based on…
In this paper, homological methods together with the theory of formal languages of theoretical computer science are proved to be effective tools to determine the growth and the Hilbert series of an associative algebra. Namely, we construct…
In the article the fact is verified that the list of words selected by formal statistical methods (frequency and functional genre unrestrictedness) is not a conglomerate of non-related words. It creates a system of interrelated items and it…
We prove a non-archimedean analogue of the fact that a closed subvariety of a semi-abelian variety is hyperbolic modulo its special locus, and thereby generalize a result of Cherry.
Let $S$ be one of $\{aba,bcb\}$ and $\{aba, aca\}$, and let $w$ be an infinite square-free word over $\Sigma=\{a,b,c\}$ with no factor in $S$. Suppose that $f:\Sigma\rightarrow T^*$ is a non-erasing morphism. Word $f(w)$ is square-free if…
We consider context-free languages equipped with the lexicographic ordering. We show that when the lexicographic ordering of a context-free language is scattered, then its Hausdorff rank is less than $\omega^\omega$. As a corollary of this…
A \emph{square} is a finite non-empty word consisting of two identical adjacent blocks. A word is \emph{square-free} if it does not contain a square as a factor. In any finite word one may delete the repeated block of a square, obtaining…
We give a new proof of Salvati's theorem that the group language $O_2$ is $2$ multiple context free. Unlike Salvati's proof, our arguments do not use any idea specific to two-dimensions. This raises the possibility that the argument might…
We give a natural complete infinitary axiomatization of the equational theory of the context-free languages, answering a question of Lei{\ss} (1992).
This work presents an information-theoretic operationalisation of cross-linguistic non-arbitrariness. It is not a new idea that there are small, cross-linguistic associations between the forms and meanings of words. For instance, it has…