Related papers: The non-abelian squares are not context-free
We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers.
It is fairly easy to show that every regular set is an almost-confluent congruential language (ACCL), and it is known that every regular set is a Church-Rosser congruential language (CRCL). Whether there exists an ACCL, which is not a CRCL,…
Any non-residually finite Baumslag-Solitar group has a non-residually finite image in the abstract commensuration of a nonabelian free group. This gives a new proof (avoiding Britton's Lemma) of the classification of residually finite…
A common question when studying a class of context-free grammars is whether equivalence is decidable within this class. We answer this question positively for the class of Clark-congruential grammars, which are of interest to grammatical…
This is an introduction to gerbes for topologists, with emphasis on non-abelian cohomology.
A graph $G = (V, E)$ is word-representable, if there exists a word w over the alphabet V such that for letters ${x, y} \in V$ , $x$ and $y$ alternate in $w$ if and only if $xy \in E$. In this paper, we prove that any non-empty…
We survey commutative and non-commutative analogs of uniform algebras in the Archimedean settings and also offer some non-Archimedean examples. Constraints on the development of non-complex uniform algebras are also discussed.
Let $G$ be a group. We denote by $\nu(G)$ an extension of the non-abelian tensor square $G \otimes G$ by $G \times G$. We prove that if $G$ is finite-by-nilpotent, then the non-abelian tensor square $G \otimes G$ is finite-by-nilpotent.…
The co-word problem of a group G generated by a set X is defined as the set of words in X which do not represent 1 in G. We introduce a new method to decide if a permutation group has context-free co-word problem. We use this method to…
We consider words over a binary alphabet. A word $w$ is overlap-free if it does not have factors (blocks of consecutive letters) of the form $uvuvu$ for nonempty $u$. Let $M(w)$ denote the number of positions that are middle positions of…
Context-free language theory is a well-established area of mathematics, relevant to computer science foundations and technology. This paper presents the preliminary results of an ongoing formalization project using context-free grammars and…
We prove that non-abelian free groups of finite rank at least 3 or of countable rank are not $\forall$-homogeneous. We answer three open questions from Kharlampovich, Myasnikov, and Sklinos regarding whether free groups, finitely generated…
The notion of Abelian complexity of infinite words was recently used by the three last authors to investigate various Abelian properties of words. In particular, using van der Waerden's theorem, they proved that if a word avoids Abelian…
We propose a scalable framework for deciding, proving, and explaining (in-)equivalence of context-free grammars. We present an implementation of the framework and evaluate it on large data sets collected within educational support systems.…
By using the abstract structures investigated in the first Part of this article, we develop a semantics for an epistemic language, which expresses sentences like "Alice knows that Bob does not understand that PI is irrational". One is…
The \emph{word problem} of a group $G = \langle \Sigma \rangle$ can be defined as the set of formal words in $\Sigma^*$ that represent the identity in $G$. When viewed as formal languages, this gives a strong connection between classes of…
We introduce context-free languages of morphisms in monoidal categories, extending recent work on the categorification of context-free languages, and regular languages of string diagrams. Context-free languages of string diagrams include…
The square-free word problem relative to a system of two defining relations is decidable.
In a previous paper with Adam Brandenburger, we used sheaf theory to analyze the structure of non-locality and contextuality. Moreover, on the basis of this formulation, we showed that the phenomena of non-locality and contextuality can be…
Using the Continuum Hyporthesis, we prove that there is a Menger-bounded (also called o-bounded) subgroup of the Baer-Specker group Z^N, whose square is not Menger-bounded. This settles a major open problem concerning boundedness notions…