On syntactic monoids of biunitary submonoids determined by homomorphisms from free semigroups onto completely simple semigroups

DOI10.1016/J.TCS.2005.09.076zbMath1086.68079OpenAlexW2030302910MaRDI QIDQ818114

Genjiro Tanaka

Publication date: 24 March 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.076

zbMATH Keywords

group codebifix codesyntactic monoidcompletely simple semigroup

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Team tournaments and finite elementary codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On syntactic monoids of biunitary submonoids determined by homomorphisms from free semigroups onto completely simple semigroups