Word hyperbolic semigroups
From MaRDI portal
Publication:4819118
DOI10.1017/S0305004103007497zbMath1064.20055arXivmath/0204353OpenAlexW2167918683MaRDI QIDQ4819118
No author found.
Publication date: 24 September 2004
Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0204353
Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Hyperbolic groups and nonpositively curved groups (20F67)
Related Items (28)
Decision problems for word-hyperbolic semigroups ⋮ Notions of hyperbolicity in monoids. ⋮ Eigenvalue gaps for hyperbolic groups and semigroups ⋮ Markov semigroups, monoids and groups ⋮ On the word problem for special monoids ⋮ GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM ⋮ Hyperbolicity of monoids presented by confluent monadic rewriting systems. ⋮ MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS ⋮ On the word problem for weakly compressible monoids ⋮ A note on the definition of small overlap monoids. ⋮ On the word problem for free products of semigroups and monoids ⋮ Generic complexity of finitely presented monoids and semigroups ⋮ A language hierarchy of binary relations ⋮ GROWTHS OF ENDOMORPHISMS OF FINITELY GENERATED SEMIGROUPS ⋮ ON UNIFORM DECISION PROBLEMS AND ABSTRACT PROPERTIES OF SMALL OVERLAP MONOIDS ⋮ CONTEXT-FREE REWRITING SYSTEMS AND WORD-HYPERBOLIC STRUCTURES WITH UNIQUENESS ⋮ Finitely presented monoids with linear Dehn function need not have regular cross-sections. ⋮ Freeness Problem for Matrix Semigroups of Parikh Matrices ⋮ The loop problem for monoids and semigroups ⋮ Finiteness and Dehn functions of automatic monoids having directed fellow traveller property. ⋮ DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS ⋮ A strong geometric hyperbolicity property for directed graphs and monoids. ⋮ INFINITE WORDS AND CONFLUENT REWRITING SYSTEMS: ENDOMORPHISM EXTENSIONS ⋮ Small overlap monoids. II: Automatic structures and normal forms. ⋮ Automaton semigroups ⋮ Automatic presentations for semigroups. ⋮ Algorithmic properties of inverse monoids with hyperbolic and tree-like Schützenberger graphs ⋮ Non-finitely generated maximal subgroups of context-free monoids
This page was built for publication: Word hyperbolic semigroups
