On graph products of automatic and biautomatic monoids.

DOI10.1007/s00233-006-0602-9zbMath1124.20040OpenAlexW2063022977MaRDI QIDQ2502268

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) Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items

On graph products of monoids ⋮ WORD EQUATIONS OVER GRAPH PRODUCTS ⋮ GRAPH PRODUCTS OF RIGHT CANCELLATIVE MONOIDS ⋮ Where Automatic Structures Benefit from Weighted Automata

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