Related papers: Solutions of Word Equations over Partially Commuta…
Generalization problems in languages with binders involve computing the most common structure between expressions while respecting bound variable renaming and freshness constraints. These problems often lack a least general solution.…
It is proven that finite idempotent left non-degenerate set-theoretic solutions $(X,r)$ of the Yang-Baxter equation on a set $X$ are determined by a left simple semigroup structure on $X$ (in particular, a finite union of isomorphic copies…
Word equations are a crucial element in the theoretical foundation of constraint solving over strings, which have received a lot of attention in recent years. A word equation relates two words over string variables and constants. Its…
We study subsets of groups and monoids defined by language-theoretic means, generalizing the classical approach to the word problem. We expand on results by Herbst from 1991 to a more general setting, and for a class of languages…
Embeddings of word structures into matrix semigroups provide a natural bridge between combinatorics on words and linear algebra. However, low-dimensional matrix semigroups impose strong structural restrictions on possible embeddings.…
A complete classification of all finite bijective set-theoretic solutions $(S,s)$ to the Pentagon Equation is obtained. First, it is shown that every such solution determines a semigroup structure on the set $S$ that is the direct product…
We describe generators and defining relations for the commutator subgroup of topological full groups of minimal subshifts. We show that the word problem in a topological full group is solvable if and only if the language of the underlying…
We study the impact of certain identities and probabilistic identities on the structure of finite groups. More specifically, let $w$ be a nontrivial word in $d$ distinct variables and let $G$ be a finite group for which the word map…
We show that the freeness problems for automaton semigroups and for automaton monoids are undecidable and, thereby, solve an open problem listed by Grigorchuk, Nekrashevych and Sush\-chansk\u{\i}i. We achieve this using a new technique to…
Algorithmic meta-theorems state that problems definable in a fixed logic can be solved efficiently on structures with certain properties. An example is Courcelle's Theorem, which states that all problems expressible in monadic second-order…
Leftist grammars [Motwani et al., STOC 2000] are special semi-Thue systems where symbols can only insert or erase to their left. We develop a theory of leftist grammars seen as word transformers as a tool toward rigorous analyses of their…
We generalise a key result of one-relator group theory, namely Magnus's Freiheitssatz, to partially commutative groups, under sufficiently strong conditions on the relator. The main theorem shows that under our conditions, on an element $r$…
In this short survey we describe recent advances on word equations with non-rational constraints in groups and monoids, highlighting the important role that formal languages play in this area.
For two given $\omega$-terms $\alpha$ and $\beta$, the word problem for $\omega$-terms over a variety $\boldsymbol{\mathrm{V}}$ asks whether $\alpha=\beta$ in all monoids in $\boldsymbol{\mathrm{V}}$. We show that the word problem for…
We consider a variant of the Boolean satisfiability problem where a subset E of the propositional variables appearing in formula Fsat encode a symmetric, transitive, binary relation over N elements. Each of these relational variables,…
During the last decades, classical models in language theory have been extended by control mechanisms defined by monoids. We study which monoids cause the extensions of context-free grammars, finite automata, or finite state transducers to…
We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive…
We introduce the notion of a subgraph generated by an $R$-word $r$ of the Sch\"{u}tzenberger graph of a positive word $w$, $S\Gamma(w)$, where $w$ contains $r$ as its subword. We show that the word problem for a finitely presented Adian…
This paper analyses stable commutator length in groups Z^r * Z^s. We bound scl from above in terms of the reduced wordlength (sharply in the limit) and from below in terms of the answer to an associated subset-sum type problem. Combining…
Monadic decomposibility --- the ability to determine whether a formula in a given logical theory can be decomposed into a boolean combination of monadic formulas --- is a powerful tool for devising a decision procedure for a given logical…