On graph products of automatic and biautomatic monoids.
From MaRDI portal
Publication:2502268
DOI10.1007/s00233-006-0602-9zbMath1124.20040MaRDI QIDQ2502268
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
68Q45: Formal languages and automata
20M05: Free semigroups, generators and relations, word problems
68Q70: Algebraic theory of languages and automata
20M35: Semigroups in automata theory, linguistics, etc.
Related Items
Where Automatic Structures Benefit from Weighted Automata, WORD EQUATIONS OVER GRAPH PRODUCTS, GRAPH PRODUCTS OF RIGHT CANCELLATIVE MONOIDS