Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference26 articles.
1. Finite complete rewriting systems and the complexity of the word problem;Bauer;Acta Inform.,1984
2. Berstel, J, and, Perrin, D. 1985, Theory of Codes, Academic Press, San Diego.
3. Bertol, M. 1996, Effiziente Normalform–Algorithmen für Ersetzungssysteme über partiell kommutativen Monoiden, Ph.D. thesis, Universität Stuttgart.
4. Bertol, M., and Diekert, V.1995, On efficient reduction-algorithms for some trace rewriting systems, inTerm RewritingH. Common and J. P. Jouannaud, Eds., Lecture Notes in Computer Science, Vol. 909, pp. 114–126, Springer-Verlag, Berlin/Heidelberg/New York.
5. Bertol, M., and Diekert, V.1996, Trace rewriting: Computing normal forms in time O(nlog n), inProceedings of the13th Annual Symposium on Theoretical Aspects of Computer Science 1996C. Puech and R. Reischuk, Eds., Lecture Notes in Computer Science, Vol. 1046, pp. 269–280, Springer-Verlag, Berlin/Heidelberg/New York.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献