The word problem for one-relation monoids: a survey
From MaRDI portal
Publication:1982573
DOI10.1007/s00233-021-10216-8OpenAlexW3192690884MaRDI QIDQ1982573
Publication date: 14 September 2021
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.02853
Generators, relations, and presentations of groups (20F05) Free semigroups, generators and relations, word problems (20M05) Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Inverse semigroups (20M18)
Related Items (8)
On the word problem for special monoids ⋮ Prefix monoids of groups and right units of special inverse monoids ⋮ Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata ⋮ On the word problem for weakly compressible monoids ⋮ Generic complexity of the word problem in some semigroups ⋮ Correction to: ``The word problem for one-relation monoids: a survey ⋮ Non-finitely generated maximal subgroups of context-free monoids ⋮ On one-relator groups and units of special one-relation inverse monoids
Uses Software
Cites Work
- Generic complexity of finitely presented monoids and semigroups
- Embedding semigroups in groups: not as simple as it might seem
- Transitive representations of inverse semigroups.
- Divisibility problem for one relator monoids
- Problems of equality and divisibility in semigroups with a single defining relation
- Presentations of inverse monoids
- Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general
- Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group
- An analysis of Turing's The word problem in semi-groups with cancellation
- Finite complete rewriting systems and the complexity of word problem
- Remarks on an example of Jantzen
- Isomorphism problem for semigroups with one defining relation
- Semigroups with one defining relation whose elementary theories are solvable
- Sur les monoides à un relateur qui sont des groupes
- Conjugacy in monoids with a special Church-Rosser presentation is decidable
- Decision problems for finite special string-rewriting systems that are confluent on some congruence class
- Complete rewriting systems and homology of monoid algebras
- Small overlap monoids. I: The word problem.
- Small overlap monoids. II: Automatic structures and normal forms.
- Automatic presentations for semigroups.
- Almost all one-rule Thue systems have decidable word problems
- A note on a special one-rule semi-Thue system
- Special monoids and special Thue systems
- Thue systems as rewriting systems
- An example of a one-relator group that is not a one-relation monoid
- Word problems and a homological finiteness condition for monoids
- A note on regular classes in special Thue systems
- On the descriptive power of special Thue systems
- On the geometry of semigroup presentations
- On a special monoid with a single defining relation
- Monadic Thue systems
- Conjugacy in special monoids
- It is undecidable whether a finite special string-rewriting system presents a group
- Completing a finite special string-rewriting system on the congruence class of the empty word
- On monoids presented by a single relation
- Transformations of words in a semigroup presented by a system of defining relations
- A class of semigroups with a decidable word problem
- Homotopy reduction systems for monoid presentations
- The word problem of inverse monoids presented by one idempotent relator
- Residual finiteness of a class of semigroups presented by a single relation
- On satisfiability of the \(C'(1/3)\) and \(C(4)\) conditions for special homogeneous semigroups with defining word-powers
- Finite derivation type implies the homological finiteness condition \(FP_ 3\)
- Frontier between decidability and undecidability: A survey
- Finite homotopy bases of one-relator monoids
- Artin monoids inject in their groups
- On the divisibility problem for one-relator monoids
- Conditions for embeddability of semigroups in groups
- Left-divisibility and word problems in single relation monoids
- On equations and first-order theory of one-relator monoids
- Calcul de longueurs de chaînes de réécriture dans le monoïde libre
- Undecidability of the word problem for one-relator inverse monoids via right-angled Artin subgroups of one-relator groups
- A structural property of Adian inverse semigroups
- Gérard Lallement (1935-2006)
- A solvable conjugacy problem for finitely presented \(C(3)\) semigroups.
- ``The theory of operations as the general theory of groups by A. K. Suskevic (Suschkewitsch), Dissertation, Voronez, 1922 (80 pages)
- On the immersion of an algebraic ring into a field
- The word problem in semi-groups with cancellation
- On theories with a combinatorial definition of 'equivalence'
- A GENERALIZATION OF ADJAN'S THEOREM ON EMBEDDINGS OF SEMIGROUPS
- The Freiheitssatz for One-Relation Monoids
- ON THE PROBLEMS OF EQUALITY AND DIVISIBILITY OF WORDS IN A SEMIGROUP WITH A DEFINING RELATION OF THE FORMa=bA
- On systems of equations over free partially commutative groups
- Dehn's algorithm for the word problem
- Rewriting Systems and Embedding of Monoids in Groups
- DECISION PROBLEMS FOR FINITELY PRESENTED AND ONE-RELATION SEMIGROUPS AND MONOIDS
- The conjugacy problem in subgroups of right-angled Artin groups
- Anton Kazimirovich Suschkewitsch (1889–1961)
- ON THE WORD AND DIVISIBILITY PROBLEMS IN SEMIGROUPS AND GROUPS WITHOUT CYCLES
- The 3x + 1 Problem and Its Generalizations
- The word problem for one-relator semigroups
- Some one-relator semigroup presentations with solvable word problems
- Embedding of rings
- SOME RELATIONS BETWEEN THE WORD AND DIVISIBILITY PROBLEMS IN GROUPS AND SEMIGROUPS
- A Short Proof of a Theorem of Adjan
- SMALL CANCELLATION CONDITIONS AND EMBEDDABILITY OF SEMIGROUPS IN GROUPS
- Inverse Monoids, Trees, and Context-Free Languages
- ON THE CONJUGACY PROBLEM FOR ONE-RELATOR MONOIDS WITH ELEMENTS OF FINITE ORDER
- Free inverse semigroups are not finitely presentable
- Free Inverse Semigroups
- ON THE WORD AND DIVISIBILITY PROBLEMS IN SEMIGROUPS WITH A SINGLE DEFINING RELATION
- On the Algebra of Semigroup Diagrams
- On the Word Problem for Single Relation Monoids with an Unbordered Relator
- Diagram groups
- On the relationship between the problems of equality and divisibility of words for semigroups with a single defining relation
- A note on bifix-free sequences (Corresp.)
- On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups
- FOLDINGS, GRAPHS OF GROUPS AND THE MEMBERSHIP PROBLEM
- Characterizations of the decidability of some problems for regular trace languages
- A note on special thue systems with a single defining relation
- ON SEMIGROUPS WITH ONE RELATION AND SEMIGROUPS WITHOUT CYCLES
- On one relator groups and HNN extensions
- DECISION AND SEPARABILITY PROBLEMS FOR BAUMSLAG–SOLITAR SEMIGROUPS
- On confluence of one-rule trace-rewriting systems
- LOW-DIMENSIONAL HOMOTOPY THEORY FOR MONOIDS
- Recursive Unsolvability of a problem of Thue
- On some algorithmic problems for groups and monoids
- One-rule trace-rewriting systems and confluence
- The B B Newman spelling theorem
- Applying rewriting methods to special monoids
- The Undecidability of the Generalized Collatz Problem
- The word problem for semigroups with one-sided cancellation
- The Solvability of the Word Problem for Certain Semigroups
- On One-Relator Groups Having Elements of Finite Order
- Positive One-Relator Groups
- On one-relator monoids and one-relator groups
- The membership problem for \(\langle a,b:bab^2=ab\rangle\)
- Decision problems for inverse monoids presented by a single sparse relator.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The word problem for one-relation monoids: a survey
