scientific article; zbMATH DE number 1740168

MaRDI QIDQ4330730zbMATH OpenFDO

Authors Friedrich Otto, N. Ruškuc

Publication date 29 September 2002

zbMATH Keywords

automatic monoidstring-rewriting system

Mathematics Subject Classification ID

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

Recommendations

• MONOIDS PRESENTED BY REWRITING SYSTEMS AND AUTOMATIC STRUCTURES FOR THEIR SUBMONOIDS
• About the descriptive power of certain classes of finite string-rewriting systems
• Publication:4938677
• scientific article; zbMATH DE number 176741
• Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids

Cited in

(8)

• 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}\)
• Finite transducers for divisibility monoids
• Uniform decision problems for automatic semigroups.
• Ends for subsemigroups of finite index.
• MONOIDS PRESENTED BY REWRITING SYSTEMS AND AUTOMATIC STRUCTURES FOR THEIR SUBMONOIDS
• Hyperbolicity of monoids presented by confluent monadic rewriting systems.
• scientific article; zbMATH DE number 176741 (Why is no real title available?)
• scientific article; zbMATH DE number 1405695 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4330730)