In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a finitely generated group G isâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Review

2013

Review

2013

The aim of this article is to survey some connections between formal language theory and group theory with particular emphasis onâ€¦Â (More)

Is this relevant?

2011

2011

- Nick D. Gilbert, Rebecca Noonan Heale
- IJAC
- 2011

We generalize the word problem for groups, the formal language of all words in the generators that represent the identity, toâ€¦Â (More)

Is this relevant?

2007

2007

- BY JOHN STILLWELL, John Stillwell
- 2007

If the fundamental problem of mathematics is to decide when two things are the same, then the fundamental problem of group theoryâ€¦Â (More)

Is this relevant?

2007

2007

- Yves Lafont
- 2007

Using rewriting techniques, we get a quite simple proof of undecidability of the word problem for groups (Novikov-Boone theorem).Â

Is this relevant?

Review

2007

Review

2007

- Arist Kojevnikov, Ivan Monakhov, Sergey K. Naumov
- 2007

The main criticism of known algebraic distributional NP (DistNP) complete problems is based on the fact that they contain tooâ€¦Â (More)

Is this relevant?

2007

2007

- Trevor Evans
- 2007

Introduction. In studying fundamental groups of manifolds, Dehn [4] in 1911 investigated some special cases of a problem which isâ€¦Â (More)

Is this relevant?

2006

2006

- R. BÃ¤r, VERENA HUBER-DYSON
- 2006

If K is a class of models for the first order language if, we denote the set of all sentences of i f that are valid in K by &~Kâ€¦Â (More)

Is this relevant?

1995

1995

- Jie Wang
- STOC
- 1995

This paper presents a bounded word problem for groups whose random instances are hard on average. The problem is to decide, whenâ€¦Â (More)

Is this relevant?

1995

1995

A Finitely Presented Monoid Which Has Solvable Word Problem But Has No Regular Complete Presentation

- Yuji Kobayashi
- Theor. Comput. Sci.
- 1995

Squier (1987) showed that there exist finitely presented monoids with solvable word problem which cannot be presented by finiteâ€¦Â (More)

Is this relevant?

1990

1990

- Norbert Kuhn, Klaus Madlener, Friedrich Otto
- ISSAC
- 1990

We apply rewriting techniques to the generalized word problem for groups. Let R be a finite string-rewriting system on anâ€¦Â (More)

Is this relevant?