On graph products of automatic monoids

DOI10.1051/ITA:2001103zbMATH Open1019.20028OpenAlexW2088024272MaRDI QIDQ3149082FDOQ3149082

Author name not available (Why is that?)

Publication date: 13 May 2003

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2001__35_5_403_0

zbMATH Keywords

graph productsautomatarational languagesautomatic 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)

Cites Work

• Algorithms and geometry for graph products of groups
• Automatic semigroups
• Automatic monoids and change of generators
• Graph products of monoids
• Extensions and submonoids of automatic monoids.
• A Geometric Characterization of Automatic Monoids
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• Centralizers in graph products of semigroups
• Standard paths and standard monomials fixed by a diagram automorphism
• GRAPH PRODUCTS OF RIGHT CANCELLATIVE MONOIDS
• WORD EQUATIONS OVER GRAPH PRODUCTS
• LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE
• On graph products of monoids
• The homomorphism problem for trace monoids.

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

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