Pseudo-natural algorithms for finitely generated presentations of monoids and groups

  • Authors:

  • Klaus Madlener;Friedrich Otto

  • Affiliations:

  • Fachbereich Informatik, Universität Kaiserslautern, Postfach 3049, 6750 Kaiserslautern, West Germany, USA;Fachbereich Informatik, Universität Kaiserslautern, Postfach 3049, 6750 Kaiserslautern, West Germany, USA

  • Venue:
  • Journal of Symbolic Computation
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

Let G be a finitely generated group such that the word problem for G is E"n-decidable for some n=1. Then there exists a finitely generated context-sensitive presentation of G such that the word problem for this presentation can be solved by a pseudo-natural algorithm in the class E"n. This result cannot be strengthened to always yield a context-free presentation. However, it can be extended to hold for finitely generated monoids as well.