Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids

DOI10.1006/JSCO.1998.0230zbMath0920.68064OpenAlexW1999697468MaRDI QIDQ1273769

Masashi Katsura, Yuji Kobayashi, Friedrich Otto

Publication date: 6 January 1999

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1998.0230

zbMATH Keywords

finitely presented monoid

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (5)

The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages ⋮ Markov semigroups, monoids and groups ⋮ Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions. ⋮ Finitely presented monoids with linear Dehn function need not have regular cross-sections. ⋮ Polygraphs of finite derivation type

This page was built for publication: Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids