Finite complete rewriting systems and the complexity of the word problem-Reference-Cited by-同舟云学术

Finite complete rewriting systems and the complexity of the word problem

Published:1984-12 Issue:5 Volume:21 Page:521-540
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

Bauer G.,Otto F.

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00271645.pdf

Reference29 articles.

1. Bauer, G.; Zur Darstellung von Monoiden durch konfluente Regelsysteme. Dissertation, Universität Kaiserslautern, 1981

2. Book, R.V.: Confluent and other types of Thue systems. J. ACM 29, 171?182 (1982)

3. Book, R.V.: Thue systems and the Church-Rosser property: replacement systems, presentations of monoids, and specifications of formal languages. In: Progress in Combinatorics on Words, L. Cummings (ed.). New York: Academic Press, pp. 1?38, 1981

4. Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Dissertation. Math. Inst. Universität Innsbruck, Austria, 1965. Aequations Mathematicae 4, 374?383 (1970)

5. Computing supplementum 4;B. Buchberger,1982

Cited by 51 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. String diagram rewrite theory III: Confluence with and without Frobenius;Mathematical Structures in Computer Science;2022-06-13

2. The word problem for one-relation monoids: a survey;Semigroup Forum;2021-08-10

3. Reconfiguration in bounded bandwidth and tree-depth;Journal of Computer and System Sciences;2018-05

4. Confluence of Graph Rewriting with Interfaces;Programming Languages and Systems;2017

5. A strong geometric hyperbolicity property for directed graphs and monoids;Journal of Algebra;2014-12