scientific article; zbMATH DE number 1740168

zbMath0993.68048MaRDI QIDQ4330730

Friedrich Otto, Nikola Ruškuc

Publication date: 29 September 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

string-rewriting systemautomatic monoid

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (5)

Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types \(A_{n}\), \(B_{n}\), \(C_{n}\), \(D_{n}\), and \(G_{2}\) ⋮ Ends for subsemigroups of finite index. ⋮ Hyperbolicity of monoids presented by confluent monadic rewriting systems. ⋮ Finite transducers for divisibility monoids ⋮ Uniform decision problems for automatic semigroups.

This page was built for publication: