Locally complete sets and finite decomposable codes (Q1605335): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4430300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le théorème du defaut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal complete sets of words / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal codes with bounded synchronization delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: On completion of codes with finite deciphering delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3700856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Each regular code is included in a maximal regular code / rank
 
Normal rank
Property / cites work
 
Property / cites work: On codes with a finite deciphering delay: Constructing uncompletable words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5610821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completing codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3737376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementariness of a finite set of words is co-NP-complete / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:55, 4 June 2024

scientific article
Language Label Description Also known as
English
Locally complete sets and finite decomposable codes
scientific article

    Statements

    Locally complete sets and finite decomposable codes (English)
    0 references
    0 references
    0 references
    15 July 2002
    0 references
    0 references
    free monoid
    0 references
    free submonoid
    0 references
    interpretation
    0 references
    uncompletable word
    0 references
    code
    0 references
    variable length code
    0 references
    thin set
    0 references
    very thin set
    0 references
    maximal code
    0 references
    dense set
    0 references
    complete set
    0 references
    Bernoulli distribution
    0 references
    locally complete
    0 references
    decomposable code
    0 references
    morphic image
    0 references