Fujita, Ken-etsu A formal system of reduction paths for parallel reduction. (English) Zbl 1433.68190 Theor. Comput. Sci. 813, 327-340 (2020). MSC: 68Q42 03B40 68R10 PDFBibTeX XMLCite \textit{K.-e. Fujita}, Theor. Comput. Sci. 813, 327--340 (2020; Zbl 1433.68190) Full Text: DOI
Kawahara, Yasuo Pushout-complements and basic concepts of grammars in toposes. (English) Zbl 0723.18004 Theor. Comput. Sci. 77, No. 3, 267-289 (1990). Reviewer: Y.Diers (Faches-Thumesnil) MSC: 18B25 68Q42 18A30 18A10 PDFBibTeX XMLCite \textit{Y. Kawahara}, Theor. Comput. Sci. 77, No. 3, 267--289 (1990; Zbl 0723.18004) Full Text: DOI
Narendran, Paliath; Otto, Friedrich Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems. (English) Zbl 0677.68050 Theor. Comput. Sci. 68, No. 3, 319-332 (1989). MSC: 68Q25 68Q65 03D03 03B25 68T15 68T99 PDFBibTeX XMLCite \textit{P. Narendran} and \textit{F. Otto}, Theor. Comput. Sci. 68, No. 3, 319--332 (1989; Zbl 0677.68050) Full Text: DOI
Yokouchi, Hirofumi Church-Rosser theorem for a rewriting system on categorical combinators. (English) Zbl 0672.03006 Theor. Comput. Sci. 65, No. 3, 271-290 (1989). Reviewer: A.Pettorossi MSC: 03B40 68N01 PDFBibTeX XMLCite \textit{H. Yokouchi}, Theor. Comput. Sci. 65, No. 3, 271--290 (1989; Zbl 0672.03006) Full Text: DOI
Oyamaguchi, Michio The Church-Rosser property for ground term-rewriting systems is decidable. (English) Zbl 0641.68044 Theor. Comput. Sci. 49, 43-79 (1987). Reviewer: J.Zlatuska MSC: 68Q65 20M05 68Q45 68T15 08A50 20M35 PDFBibTeX XMLCite \textit{M. Oyamaguchi}, Theor. Comput. Sci. 49, 43--79 (1987; Zbl 0641.68044) Full Text: DOI