On a complete set of operations for factorizing codes (Q3374755): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2708959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-ambiguous decomposition of regular languages and factorizing codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4430300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une famille remarquable de codes indecomposables / rank
 
Normal rank
Property / cites work
 
Property / cites work: SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronization and decomposability for a family of codes. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur un algorithme donnant les codes bipréfixes finis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4106058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of a family of finite maximal codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial result about the factorization conjecture for finite variable- length codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of Hajós factorizations to variable-length codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some Schützenberger conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An enhanced property of factorizing codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3700856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4725767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A three-word code which is not prefix-suffix composed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3281123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5798059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5764949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on codes having no finite completions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hajós factorizations and completion of codes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally complete sets and finite decomposable codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5610821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes asynchrones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3942894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On codes having no finite completions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes and local constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completing codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the lattice of prefix codes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the factorization of codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noncommutative factorization of variable-length codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the factorisation of finite abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348039 / rank
 
Normal rank

Latest revision as of 10:39, 24 June 2024

scientific article
Language Label Description Also known as
English
On a complete set of operations for factorizing codes
scientific article

    Statements

    On a complete set of operations for factorizing codes (English)
    0 references
    0 references
    22 February 2006
    0 references
    free monoid generated by a finite alphabet
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers