Notions of hyperbolicity in monoids.
From MaRDI portal
Publication:846368
DOI10.1016/J.TCS.2009.10.016zbMath1209.20050OpenAlexW3005305491MaRDI QIDQ846368
Publication date: 9 February 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.10.016
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Hyperbolic groups and nonpositively curved groups (20F67)
Related Items (2)
MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS ⋮ A strong geometric hyperbolicity property for directed graphs and monoids.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Notions of automaticity in semigroups.
- On the definition of word hyperbolic groups.
- Automatic semigroups
- Visibly pushdown languages
- WORD-HYPERBOLIC GROUPS HAVE REAL-TIME WORD PROBLEM
- Word hyperbolic semigroups
- THE LINEARITY OF THE CONJUGACY PROBLEM IN WORD-HYPERBOLIC GROUPS
- Fundamentals of Computation Theory
This page was built for publication: Notions of hyperbolicity in monoids.