"Finite Complete Rewriting Systems and the Complexity of the Word Problem."

G. Bauer, Friedrich Otto (1984)

> Home

Details and statistics

DOI: 10.1007/BF00271645

access: closed

type: Journal Article

metadata version: 2020-06-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/acta/BauerO84
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/acta/BauerO84
G. Bauer, Friedrich Otto:
Finite Complete Rewriting Systems and the Complexity of the Word Problem. Acta Informatica 21: 521-540 (1984)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.