Unique decipherability in the additive monoid of sets of numbers (Q5198933): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3714479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Problem of Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique Decipherability in the Monoid of Languages: An Application of Rational Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3681045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Frobenius Problem in a Free Monoid / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Equivalence Problem of Finite Substitutions on <font>ab*c</font>, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of commuting with finite sets of words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes conjugués / rank
 
Normal rank

Latest revision as of 08:50, 4 July 2024

scientific article; zbMATH DE number 5937669
Language Label Description Also known as
English
Unique decipherability in the additive monoid of sets of numbers
scientific article; zbMATH DE number 5937669

    Statements

    Identifiers