English
Related papers

Related papers: Quasigeodesic languages are not context-free in so…

200 papers

Let $G$ be a finitely generated group, $A$ a finite set of generators and $K$ a subgroup of $G$. We call the pair $(G,K)$ context-free if the set of all words over $A$ that reduce in $G$ to an element of $K$ is a context-free language. When…

Group Theory · Mathematics 2012-12-05 Tullio Ceccherini-Silberstein , Wolfgang Woess

Cannon has given an example of a virtually abelian group and a generating set where the full language of geodesics is not regular. We describe a virtually abelian group and a generating set so that no regular language of geodesics surjects…

Group Theory · Mathematics 2009-09-25 Walter Neumann , Michael Shapiro

Starting from context-free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their co-word problems are context-free, analyze torsion elements, and realize…

Group Theory · Mathematics 2025-11-18 Daniele D'Angeli , Francesco Matucci , Davide Perego , Emanuele Rodaro

The complexity of a geodesic language has connections to algebraic properties of the group. Gilman, Hermiller, Holt, and Rees show that a finitely generated group is virtually free if and only if its geodesic language is locally excluding…

Group Theory · Mathematics 2017-05-04 Maranda Franke

In 2018, it was shown that all finitely generated virtually Abelian groups have multiple context-free word problems, and it is still an open problem as to where to precisely place the word problems of hyperbolic groups in the formal…

Formal Languages and Automata Theory · Computer Science 2021-01-08 Graham Campbell

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…

Group Theory · Mathematics 2010-07-06 Robert Gilman , Alexei Miasnikov , Denis Osin

We describe a procedure which verifies that a group given by generators and relators is word-hyperbolic. This procedure always works with a group which is word-hyperbolic, provided there is sufficient memory and time devoted to the problem.…

Group Theory · Mathematics 2007-05-23 David B. A. Epstein , Derek F. Holt

The following short note provides an alternative proof of a result of Coornaert: namely, that given a non-elementary word-hyperbolic group $G$ with a finite generating set $X$, there exist constants $\lambda,D > 1$ such that \[…

Group Theory · Mathematics 2019-02-15 Motiejus Valiunas

We prove a Morse Lemma for coarsely regular quasigeodesics in nonpositively curved symmetric spaces and euclidean buildings X. The main application is a simpler coarse geometric characterization of Morse subgroups of the isometry groups…

Group Theory · Mathematics 2018-12-19 Michael Kapovich , Bernhard Leeb , Joan Porti

It was conjectured in [KLS14] that non-elementary word hyperbolic groups are never invariably generated. We show that this is indeed the case even for the much larger class of convergence groups.

Group Theory · Mathematics 2014-12-03 Tsachik Gelander

The notions of stable and Morse subgroups of finitely generated groups generalize the concept of a quasiconvex subgroup of a word-hyperbolic group. For a word-hyperbolic group $G$, Kapovich provided a partial algorithm which, on input a…

Group Theory · Mathematics 2020-04-21 Heejoung Kim

Weighted automata model quantitative aspects of systems like the consumption of resources during executions. Traditionally, the weights are assumed to form the algebraic structure of a semiring, but recently also other weight computations…

Formal Languages and Automata Theory · Computer Science 2016-03-04 Manfred Droste , Heiko Vogler

The hyperedge replacement grammar (HRG) formalism is a natural and well-known generalization of context-free grammars. HRGs inherit a number of properties of context-free grammars, e.g. the pumping lemma. This lemma turns out to be a strong…

Formal Languages and Automata Theory · Computer Science 2021-12-22 Tikhon Pshenitsyn

We propose a criterion for preserving the regularity of a formal language representation when passing from groups to subgroups. We use this criterion to show that the regularity of a positive cone language in a left-orderable group passes…

Group Theory · Mathematics 2020-04-28 Hang Lu Su

This paper studies the classes of semigoups and monoids with context-free and deterministic context-free word problem. First, some examples are exhibited to clarify the relationship between these classes and their connection with the…

Group Theory · Mathematics 2019-03-26 Tara Brough , Alan J. Cain , Markus Pfeiffer

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…

Group Theory · Mathematics 2019-02-13 David Bruce Cohen

We construct an example of a torsion free freely indecomposable finitely presented non-quasiconvex subgroup $H$ of a word hyperbolic group $G$ such that the limit set of $H$ is not the limit set of a quasiconvex subgroup of $G$. In…

Group Theory · Mathematics 2009-09-25 Ilya Kapovich

In this article we show that every group with a finite presentation satisfying one or both of the small cancellation conditions $C'(1/6)$ and $C'(1/4)-T(4)$ has the property that the set of all geodesics (over the same generating set) is a…

Group Theory · Mathematics 2011-11-04 S. Hermiller , Derek F. Holt , Sarah Rees

We call a graph $k$-geodetic, for some $k\geq 1$, if it is connected and between any two vertices there are at most $k$ geodesics. It is shown that any hyperbolic group with a $k$-geodetic Cayley graph is virtually-free. Furthermore, in…

Group Theory · Mathematics 2023-06-16 Murray Elder , Adam Piggott , Kane Townsend

The word problem of a finitely generated group is the formal language of words over the generators which are equal to the identity in the group. If this language happens to be context-free, then the group is called context-free. Finitely…

Group Theory · Mathematics 2022-03-17 Volker Diekert , Armin Weiß