Login / Signup
A Finitely Presented Monoid Which Has Solvable Word Problem But Has No Regular Complete Presentation.
Yuji Kobayashi
Published in:
Theor. Comput. Sci. (1995)
Keyphrases
</>
special case
np hard
word problems
np complete
computer assisted