Cross-sections for finitely presented monoids with decidable word problems
From MaRDI portal
Publication:4594218
DOI10.1007/3-540-62950-5_61zbMath1379.68201OpenAlexW1565873802MaRDI QIDQ4594218
Friedrich Otto, Masashi Katsura, Yuji Kobayashi
Publication date: 17 November 2017
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-62950-5_61
Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42)
Related Items
Growing context-sensitive languages and Church-Rosser languages ⋮ Equational Theorem Proving for Clauses over Strings ⋮ The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages