The word problem for one-relation monoids: a survey (Q1982573)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	The word problem for one-relation monoids: a survey	scientific article

Statements

scholarly article

0 references

The word problem for one-relation monoids: a survey (English)

0 references

Carl-Fredrik Nyberg-Brodda

0 references

Semigroup Forum

0 references

publication date

14 September 2021

0 references

full work available at URL

https://arxiv.org/abs/2105.02853

0 references

zbMATH Keywords

word problem

0 references

one-relation monoid

0 references

semigroups

0 references

decidability

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

Characterizations of the decidability of some problems for regular trace languages

0 references

0 references

0 references

0 references

0 references

Transformations of words in a semigroup presented by a system of defining relations

0 references

On some algorithmic problems for groups and monoids

0 references

On the divisibility problem for one-relator monoids

0 references

Divisibility problem for one relator monoids

0 references

On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups

0 references

0 references

0 references

The word problem for semigroups with one-sided cancellation

0 references

ON THE WORD AND DIVISIBILITY PROBLEMS IN SEMIGROUPS WITH A SINGLE DEFINING RELATION

0 references

Problems of equality and divisibility in semigroups with a single defining relation

0 references

Gérard Lallement (1935-2006)

0 references

Finite complete rewriting systems and the complexity of word problem

0 references

Positive One-Relator Groups

0 references

The word problem of inverse monoids presented by one idempotent relator

0 references

Embedding of rings

0 references

A note on special thue systems with a single defining relation

0 references

Thue systems as rewriting systems

0 references

Monadic Thue systems

0 references

Almost all one-rule Thue systems have decidable word problems

0 references

An analysis of Turing's ''The word problem in semi-groups with cancellation''

0 references

0 references

0 references

A note on regular classes in special Thue systems

0 references

0 references

DECISION PROBLEMS FOR FINITELY PRESENTED AND ONE-RELATION SEMIGROUPS AND MONOIDS

0 references

Automatic presentations for semigroups.

0 references

0 references

On systems of equations over free partially commutative groups

0 references

0 references

0 references

Rewriting Systems and Embedding of Monoids in Groups

0 references

0 references

Finite derivation type implies the homological finiteness condition \(FP_ 3\)

0 references

The conjugacy problem in subgroups of right-angled Artin groups

0 references

0 references

A solvable conjugacy problem for finitely presented \(C(3)\) semigroups.

0 references

0 references

On One-Relator Groups Having Elements of Finite Order

0 references

On equations and first-order theory of one-relator monoids

0 references

0 references

``The theory of operations as the general theory of groups'' by A. K. Suskevic (Suschkewitsch), Dissertation, Voronez, 1922 (80 pages)

0 references

Undecidability of the word problem for one-relator inverse monoids via right-angled Artin subgroups of one-relator groups

0 references

Dehn's algorithm for the word problem

0 references

Conditions for embeddability of semigroups in groups

0 references

On the relationship between the problems of equality and divisibility of words for semigroups with a single defining relation

0 references

0 references

Decision problems for inverse monoids presented by a single sparse relator.

0 references

0 references

Anton Kazimirovich Suschkewitsch (1889–1961)

0 references

Embedding semigroups in groups: not as simple as it might seem

0 references

The word problem for one-relator semigroups

0 references

A structural property of Adian inverse semigroups

0 references

On one-relator monoids and one-relator groups

0 references

Some one-relator semigroup presentations with solvable word problems

0 references

The membership problem for \(\langle a,b:bab^2=ab\rangle\)

0 references

DECISION AND SEPARABILITY PROBLEMS FOR BAUMSLAG–SOLITAR SEMIGROUPS

0 references

On a special monoid with a single defining relation

0 references

A note on a special one-rule semi-Thue system

0 references

0 references

Small overlap monoids. I: The word problem.

0 references

Small overlap monoids. II: Automatic structures and normal forms.

0 references

Generic complexity of finitely presented monoids and semigroups

0 references

FOLDINGS, GRAPHS OF GROUPS AND THE MEMBERSHIP PROBLEM

0 references

0 references

SMALL CANCELLATION CONDITIONS AND EMBEDDABILITY OF SEMIGROUPS IN GROUPS

0 references

On satisfiability of the \(C'(1/3)\) and \(C(4)\) conditions for special homogeneous semigroups with defining word-powers

0 references

A GENERALIZATION OF ADJAN'S THEOREM ON EMBEDDINGS OF SEMIGROUPS

0 references

On the Algebra of Semigroup Diagrams

0 references

Complete rewriting systems and homology of monoid algebras

0 references

Homotopy reduction systems for monoid presentations

0 references

Finite homotopy bases of one-relator monoids

0 references

0 references

The Undecidability of the Generalized Collatz Problem

0 references

The 3x + 1 Problem and Its Generalizations

0 references

On monoids presented by a single relation

0 references

0 references

0 references

Residual finiteness of a class of semigroups presented by a single relation

0 references

0 references

On the immersion of an algebraic ring into a field

0 references

0 references

0 references

Frontier between decidability and undecidability: A survey

0 references

0 references

Inverse Monoids, Trees, and Context-Free Languages

0 references

0 references

0 references

0 references

0 references

0 references

On one relator groups and <i>HNN</i> extensions

0 references

Special monoids and special Thue systems

0 references

Calcul de longueurs de chaînes de réécriture dans le monoïde libre

0 references

Free Inverse Semigroups

0 references

It is undecidable whether a finite special string-rewriting system presents a group

0 references

On theories with a combinatorial definition of 'equivalence'

0 references

A note on bifix-free sequences (Corresp.)

0 references

The B B Newman spelling theorem

0 references

A class of semigroups with a decidable word problem

0 references

ON THE PROBLEMS OF EQUALITY AND DIVISIBILITY OF WORDS IN A SEMIGROUP WITH A DEFINING RELATION OF THE FORM<i>a</i>=<i>bA</i>

0 references

0 references

ON SEMIGROUPS WITH ONE RELATION AND SEMIGROUPS WITHOUT CYCLES

0 references

Isomorphism problem for semigroups with one defining relation

0 references

0 references

0 references

Conjugacy in monoids with a special Church-Rosser presentation is decidable

0 references

Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group

0 references

An example of a one-relator group that is not a one-relation monoid

0 references

Completing a finite special string-rewriting system on the congruence class of the empty word

0 references

Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general

0 references

Decision problems for finite special string-rewriting systems that are confluent on some congruence class

0 references

Artin monoids inject in their groups

0 references

Sur les monoides à un relateur qui sont des groupes

0 references

Recursive Unsolvability of a problem of Thue

0 references

Remarks on an example of Jantzen

0 references

LOW-DIMENSIONAL HOMOTOPY THEORY FOR MONOIDS

0 references

On the geometry of semigroup presentations

0 references

0 references

SOME RELATIONS BETWEEN THE WORD AND DIVISIBILITY PROBLEMS IN GROUPS AND SEMIGROUPS

0 references

ON THE WORD AND DIVISIBILITY PROBLEMS IN SEMIGROUPS AND GROUPS WITHOUT CYCLES

0 references

Free inverse semigroups are not finitely presentable

0 references

Transitive representations of inverse semigroups.

0 references

0 references

0 references

0 references

The Freiheitssatz for One-Relation Monoids

0 references

Word problems and a homological finiteness condition for monoids

0 references

Presentations of inverse monoids

0 references

0 references

The word problem in semi-groups with cancellation

0 references

Semigroups with one defining relation whose elementary theories are solvable

0 references

0 references

Left-divisibility and word problems in single relation monoids

0 references

On the Word Problem for Single Relation Monoids with an Unbordered Relator

0 references

0 references

On confluence of one-rule trace-rewriting systems

0 references

One-rule trace-rewriting systems and confluence

0 references

The Solvability of the Word Problem for Certain Semigroups

0 references

Conjugacy in special monoids

0 references

Applying rewriting methods to special monoids

0 references

0 references

ON THE CONJUGACY PROBLEM FOR ONE-RELATOR MONOIDS WITH ELEMENTS OF FINITE ORDER

0 references

A Short Proof of a Theorem of Adjan

0 references

On the descriptive power of special Thue systems

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S00233-021-10216-8

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1982573

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1982573&oldid=38814670"