An alternative formulation of the factorization conjecture for codes (Q1280224)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An alternative formulation of the factorization conjecture for codes |
scientific article; zbMATH DE number 1260653
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An alternative formulation of the factorization conjecture for codes |
scientific article; zbMATH DE number 1260653 |
Statements
An alternative formulation of the factorization conjecture for codes (English)
0 references
14 March 1999
0 references
The aim of this paper is to give an equivalent formulation of the factorization conjecture for codes. Recall that this conjecture states that every finite and maximal code can be factorized. The main result of this paper is to give a characterization of factorizing codes in terms of petal automata, based on a result by \textit{A. Restivo} on bayonet codes [Discrete Math. 17, 309-316 (1977; Zbl 0357.94011)].
0 references
petal automata
0 references
free submonoids
0 references
