×

Found 13 Documents (Results 1–13)

Undecidability results for monoids with linear-time decidable word problems. (English) Zbl 1044.03029

Lee, D. T. (ed.) et al., Algorithms and computation. 11th international conference, ISAAC 2000, Taipei, Taiwan, December 18–20, 2000. Proceedings. Berlin: Springer (ISBN 3-540-41255-7). Lect. Notes Comput. Sci. 1969, 278-289 (2000).
MSC:  03D35 68Q42 68Q45
PDFBibTeX XMLCite
Full Text: Link

Cross-sections for finitely presented monoids with decidable word problems. (English) Zbl 1379.68201

Comon, Hubert (ed.), Rewriting techniques and applications. 8th international conference, RTA ’97, Sitges, Spain, June 2–5, 1997. Proceedings. Berlin: Springer (ISBN 978-3-540-62950-4/pbk; 978-3-540-69051-1/ebook). Lecture Notes in Computer Science 1232, 53-67 (1997).
MSC:  68Q42 20M05 20M35
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field