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

Abstract: We deal with the maximal bifix code construction which is a natural generalization of a group code construction. For a surjective morphism from a free monoid onto a completely simple semigroup with an adjoined identity and a submonoid of , under certain conditions, the base of a submonoid is a maximal bifix code . We investigate the relationships between the surjective morphism and the syntactic monoid of the monoid generated by . [Copyright &y& Elsevier]