English
Related papers

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

200 papers

We find strictly ascending HNN extensions of finite rank free groups possessing a presentation 2-complex which is a non positively curved square complex. On showing these groups are word hyperbolic, we have by results of Wise and Agol that…

Group Theory · Mathematics 2013-02-22 J. O. Button

We prove that the class of linear context-free tree languages is not closed under inverse linear tree homomorphisms. The proof is by contradiction: we encode Dyck words into a context-free tree language and prove that its preimage under a…

Formal Languages and Automata Theory · Computer Science 2015-10-20 Johannes Osterholzer , Toni Dietze , Luisa Herrmann

Hyperproperties lift conventional trace-based languages from a set of execution traces to a set of sets of executions. From a formal-language perspective, these are sets of sets of words, namely hyperlanguages. Hyperautomata are based on…

Formal Languages and Automata Theory · Computer Science 2022-09-22 Hadar Frenkel , Sarai Sheinvald

We prove that every monoid $\mathrm{Mon}\langle a,b:a^{\alpha}b^{\beta}a^{\gamma}b^{\delta}=b\rangle$ admits a finite complete rewriting system. Furthermore we prove that $\mathrm{Mon}\langle a,b:ab^2a^2b^2=b\rangle$ is non-hopfian,…

Group Theory · Mathematics 2013-02-06 Alan Cain , Victor Maltcev

In this paper we study rewriting systems for groups and monoids, focusing on situations where finite convergent systems may be difficult to find or do not exist. We consider systems which have no length increasing rules and are confluent…

Group Theory · Mathematics 2012-11-14 Volker Diekert , Andrew J. Duncan , Alexei Miasnikov

Let $\Phi:F\rightarrow F$ be an automorphism of the finite-rank free group $F$. Suppose that $G=F\rtimes_\Phi\mathbb Z$ is word-hyperbolic. Then $G$ acts freely and cocompactly on a CAT(0) cube complex.

Group Theory · Mathematics 2016-05-27 Mark F. Hagen , Daniel T. Wise

We prove several topological and dynamical properties of the boundary of a hierarchically hyperbolic group are independent of the specific hierarchically hyperbolic structure. This is accomplished by proving that the boundary is invariant…

Group Theory · Mathematics 2023-03-20 Carolyn Abbott , Jason Behrstock , Jacob Russell

String rewriting systems have proved very useful to study monoids. In good cases, they give finite presentations of monoids, allowing computations on those and their manipulation by a computer. Even better, when the presentation is…

Logic in Computer Science · Computer Science 2015-07-01 Samuel Mimram

We consider some questions about formal languages that arise when inverses of letters, words and languages are defined. The reduced representation of a language over the free monoid is its unique equivalent representation in the free group.…

Formal Languages and Automata Theory · Computer Science 2009-10-26 Thomas Ang , Giovanni Pighizzini , Narad Rampersad , Jeffrey Shallit

The hyperbolic structure on a 3-dimensional cone-manifold with a knot as singularity can often be deformed into a limiting Euclidean structure. In the present paper we show that the respective normalised Euclidean volume is always an…

Geometric Topology · Mathematics 2021-07-08 Nikolay Abrosimov , Alexander Kolpakov , Alexander Mednykh

For any finite collection $f_i$ of fully irreducible automorphisms of the free group $F_n$ we construct a connected $\delta$-hyperbolic $Out(F_n)$-complex in which each $f_i$ has positive translation length.

Group Theory · Mathematics 2009-11-09 Mladen Bestvina , Mark Feighn

We study rewriting for equational theories in the context of symmetric monoidal categories where there is a separable Frobenius monoid on each object. These categories, also called hypergraph categories, are increasingly relevant: Frobenius…

Logic in Computer Science · Computer Science 2018-01-04 Fabio Zanasi

String diagrams are a powerful and intuitive graphical syntax for terms of symmetric monoidal categories (SMCs). They find many applications in computer science and are becoming increasingly relevant in other fields such as physics and…

Category Theory · Mathematics 2016-12-01 Filippo Bonchi , Fabio Gadducci , Aleks Kissinger , Pawel Sobocinski , Fabio Zanasi

We describe a generic construction of non-wellfounded syntax involving variable binding and its monadic substitution operation. Our construction of the syntax and its substitution takes place in category theory, notably by using monoidal…

Programming Languages · Computer Science 2024-05-08 Ralph Matthes , Kobe Wullaert , Benedikt Ahrens

The aim of this note is to prove that monoids $\mathrm{Mon}\langle a,b:aUb=b\rangle$, with $aUb$ of relative length 6, admit finite complete rewriting systems. This is some advance in the understanding the long-standing open problem whether…

Group Theory · Mathematics 2022-11-01 Alan Cain , Victor Maltcev

A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating…

Group Theory · Mathematics 2015-10-21 Alan J. Cain , Victor Maltcev

We discuss the linearity and discreteness of amalgamated products of linear word-hyperbolic groups. In particular, we prove that the double of an Anosov group along a maximal cyclic subgroup is always linear, and we construct examples of…

Group Theory · Mathematics 2022-06-27 Nicolas Tholozan , Konstantinos Tsouvalas

For a transitive sectional-hypebolic set $\Lambda$ with positive volume on a $d$-dimensional manifold $M$($d\ge3$), we show that $\Lambda=M$ and $\Lambda$ is a uniformly hyperbolic set without singularities

Dynamical Systems · Mathematics 2025-05-05 Daofei Zhang , Yuntao Zang

Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…

Category Theory · Mathematics 2007-05-31 Jonathan A. Cohen

Motivated by its applications to the word problem for one-relator inverse monoids, via results of Ivanov, Margolis, and Meakin (2001), we prove several decidability and undecidability results about the submonoid membership problem in…

Group Theory · Mathematics 2025-09-30 Islam Foniqi , Robert D. Gray