On graph products of automatic and biautomatic monoids.

DOI10.1007/S00233-006-0602-9zbMATH Open1124.20040OpenAlexW2063022977MaRDI QIDQ2502268FDOQ2502268

Dietrich Kuske, Egbert Fohry

Publication date: 12 September 2006

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00233-006-0602-9

zbMATH Keywords

graph productsbiautomatic monoidsautomatic monoidsfree products of monoids

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Cited In (5)

• GRAPH PRODUCTS OF RIGHT CANCELLATIVE MONOIDS
• WORD EQUATIONS OVER GRAPH PRODUCTS
• Extensions and submonoids of automatic monoids.
• Where Automatic Structures Benefit from Weighted Automata
• On graph products of monoids

This page was built for publication: On graph products of automatic and biautomatic monoids.

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