Word hyperbolic semigroups

DOI10.1017/S0305004103007497MaRDI QIDQ4819118zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

automatacontext-free grammarsword problemlanguagesrational subsetsword hyperbolic semigroups

Mathematics Subject Classification ID

Hyperbolic groups and nonpositively curved groups (20F67) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Abstract: The study of word hyperbolic groups is a prominent topic in geometric group theory; however word hyperbolic groups are defined by a geometric condition which does not extend naturally to semigroups. We propose a linguistic definition. Roughly speaking a semigroup is word hyperbolic if its multiplication table is a context free language. For groups this definition is equivalent to the original geometric one. We also briefly consider word problems of semigroups.

Recommendations

• Hyperbolicity of semigroup algebras.
• Hyperbolic groups and completely simple semigroups.
• scientific article; zbMATH DE number 482857
• scientific article; zbMATH DE number 3162939
• Hyperaction of semigroups and monoids.
• Publication:4865833
• On hypersemigroups
• On hypersemigroups
• On Sperner (semi)hypergroups.
• Decision problems for word-hyperbolic semigroups

Cited in

(33)

• INFINITE WORDS AND CONFLUENT REWRITING SYSTEMS: ENDOMORPHISM EXTENSIONS
• A semigroup with linearithmic Dehn function
• Markov semigroups, monoids and groups.
• On the definition of word hyperbolic groups.
• A note on the definition of small overlap monoids.
• GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM
• Hyperbolic groups and completely simple semigroups.
• Automaton semigroups
• On the word problem for weakly compressible monoids
• Growths of endomorphisms of finitely generated semigroups
• On the word problem for special monoids
• A strong geometric hyperbolicity property for directed graphs and monoids.
• Hyperbolicity of monoids presented by confluent monadic rewriting systems.
• Semiperiodic words and root-conjugacy.
• MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS
• Eigenvalue gaps for hyperbolic groups and semigroups
• The loop problem for monoids and semigroups
• Finiteness and Dehn functions of automatic monoids having directed fellow traveller property.
• Decision problems for word-hyperbolic semigroups
• On uniform decision problems and abstract properties of small overlap monoids.
• Context-free rewriting systems and word-hyperbolic structures with uniqueness
• On the word problem for free products of semigroups and monoids
• Small overlap monoids. II: Automatic structures and normal forms.
• Algorithmic properties of inverse monoids with hyperbolic and tree-like Schützenberger graphs
• Notions of hyperbolicity in monoids.
• Freeness problem for matrix semigroups of Parikh matrices
• Non-finitely generated maximal subgroups of context-free monoids
• Generic complexity of finitely presented monoids and semigroups
• DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS
• A language hierarchy of binary relations
• Finitely presented monoids with linear Dehn function need not have regular cross-sections.
• Automatic presentations for semigroups.
• Free products of semigroups and monoids with a deterministic context-free word problem

This page was built for publication: Word hyperbolic semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4819118)