Related papers: Context-free rewriting systems and word-hyperbolic…

In this paper we study the generic, i.e., typical, behavior of finitely generated subgroups of hyperbolic groups and also the generic behavior of the word problem for amenable groups. We show that a random set of elements of a nonelementary…

For finitely generated groups H and G, equipped with word metrics, a translation-like action of H on G is a free action such that each element of H acts by a map which has finite distance from the identity map in the uniform metric. For…

We study the language-theoretic aspects of the word problem, in the sense of Duncan & Gilman, of free products of semigroups and monoids. First, we provide algebraic tools for studying classes of languages known as super-AFLs, which…

Embedded topic models are able to learn interpretable topics even with large and heavy-tailed vocabularies. However, they generally hold the Euclidean embedding space assumption, leading to a basic limitation in capturing hierarchical…

Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even better, when the presentation is confluent and terminating,…

Dynamic topic modeling is widely used to analyze evolving trends in scientific literature, medical records, and social media. Traditional topic models represent each topic through a single probability vector on the multinomial simplex and…

We prove several results concerning finitely generated submonoids of the free monoid. These results generalize those known for free submonoids. We prove in particular that if $X=Y\circ Z$ is a composition of finite sets of words with $Y$…

Given isometric actions by a group G on finitely many \delta-hyperbolic metric spaces, we provide a sufficient condition that guarantees the existence of a single element in G that is hyperbolic for each action. As an application we prove a…

We establish a natural translation from word rewriting systems to strictly positive polymodal logics. Thereby, the latter can be considered as a generalization of the former. As a corollary we obtain examples of undecidable strictly…

Let S be a closed surface of genus at least 2. We show that a finitely generated group G which is an extension of the fundamental group H of S is word hyperbolic if and only the orbit map of the quotient group G/H on the complex of curves…

One of the main reasons for the correspondence of regular languages and monadic second-order logic is that the class of regular languages is closed under images of surjective letter-to-letter homomorphisms. This closure property holds for…

We prove that an automorphism $\phi:F\to F$ of a finitely generated free group $F$ is hyperbolic in the sense of Gromov if it has no nontrivial periodic conjugacy classes.

We choose random points in the hyperbolic disc and claim that these points are already word representations. However, it is yet to be uncovered which point corresponds to which word of the human language of interest. This correspondence can…

Image-text representation learning forms a cornerstone in vision-language models, where pairs of images and textual descriptions are contrastively aligned in a shared embedding space. Since visual and textual concepts are naturally…

We show that any measurable solution of the cohomological equation for a H\"older linear cocycle over a hyperbolic system coincides almost everywhere with a H\"older solution. More generally, we show that every measurable invariant…

We propose a way of associating to each finitely generated monoid or semigroup a formal language, called its loop problem. In the case of a group, the loop problem is essentially the same as the word problem in the sense of combinatorial…

We present a term rewriting system that models the dynamic aspects of the free cornering with protocol choice of a monoidal category, which has been proposed as a categorical model of process interaction. This term rewriting system is…

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 show that the mapping torus of a hyperbolic group by a hyperbolic automorphism is cubulable. Along the way, we (i) give an alternate proof of Hagen and Wise's theorem that hyperbolic free-by-cyclic groups are cubulable, and (ii) extend…

We consider the structures given by repeatedly generalising the definition of finite state automata by symmetry considerations, and constructing analogues of transition monoids at each step. This approach first gives us non-deterministic…