Code properties of minimal generating sets of retracts and semiretracts
type: Item
instance of: scholarly article
title: Code properties of minimal generating sets of retracts and semiretracts
zbMATH Open document ID: 0831.20092
author: James Anderson
published in: Southeast Asian Bulletin of Mathematics
publication date: 1995-03-13T00:00:00Z
review text: Let \(A\) be a finite set and \(A^*\) be the free monoid on \(A\). A retract of \(A^*\) is a submonoid of \(A^*\) which is the image of an idempotent homomorphism from \(A^*\) to \(A^*\). A semiretract of \(A^*\) is the intersection of a family of retracts of \(A^*\). In the paper a survey is given of code properties of the minimal generating set of retracts and semiretracts. These are then used to prove properties of syntactic monoids of retracts and semiretracts.
Mathematics Subject Classification ID: 20M35
Mathematics Subject Classification ID: 20M05
zbMATH DE Number: 733171
zbMATH Keywords: finite set
zbMATH Keywords: free monoid
zbMATH Keywords: idempotent homomorphism
zbMATH Keywords: minimal generating set
zbMATH Keywords: retracts
zbMATH Keywords: semiretracts
zbMATH Keywords: syntactic monoids
reviewed by: Marie Demlová
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 733171