Groups in the syntactic monoid of a composed code
type: Item
instance of: scholarly article
title: Groups in the syntactic monoid of a composed code
zbMATH Open document ID: 0602.20061
DOI: 10.1016/0022-4049(86)90013-7
author: Pascal Weil
published in: Journal of Pure and Applied Algebra
publication date: 1986-01-01T00:00:00Z
review text: It is proved: Let Y and Z be codes (with Z finite) and let \(X=Y\circ Z\). Then every group in \(M(X^*)\), the syntactic monoid of \(X^*\), divides a generalized wreath product \((G_ 1\times...\times G_ n)\square H\), where \(G_ 1,...,G_ n\) are groups dividing \(M(Y^*)\) and H is a group dividing \(M(Z^*)\). For the convenience of the reader all definitions and results needed are summarized and most of the results are proved.
Mathematics Subject Classification ID: 20M35
Mathematics Subject Classification ID: 94B60
Mathematics Subject Classification ID: 68Q70
zbMATH DE Number: 3971071
zbMATH Keywords: unambiguous automaton
zbMATH Keywords: codes
zbMATH Keywords: syntactic monoid
zbMATH Keywords: generalized wreath product
reviewed by: Marie Demlová
MaRDI profile type: Publication
full work available at URL: 0022-4049(86)90013-7
OpenAlex ID: W1997711875
cites work: Q4430300
cites work: Q4132170
cites work: Q3853827
cites work: Q3776657
cites work: Q3960138
description: scientific article; zbMATH DE number 3971071