ScholarLens Back to search
1987•Lecture notes in computer scienceOpen access

The word problem for finitely presented monoids and finite canonical rewriting systems

Craig C. Squier, Friedrich Otto

Open full text 19 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 19 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Rewriting, Monoid, Decidability, Word problem (mathematics education), Free monoid, Syntactic monoid, Word (group theory), Mathematics

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
The word problem for finitely presented monoids and finite canonical rewriting systems — Research Paper | ScholarLens