On the syntactic transformation semigroup of a language generated by a finite biprefix code (Q1165022): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On certain codes admitting inverse semigroups as syntactic monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On varieties of rational languages and variable length codes. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le monoide syntactique de \(L^*\)lorsque L est un langage fini / rank
 
Normal rank
Property / cites work
 
Property / cites work: On varieties of rational languages and variable-length codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une topologie du monoide libre / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur mon article ''Une topologie du monoide libre'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le produit de concatenation non ambigu / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of finite semigroups / rank
 
Normal rank

Latest revision as of 14:56, 13 June 2024

scientific article
Language Label Description Also known as
English
On the syntactic transformation semigroup of a language generated by a finite biprefix code
scientific article

    Statements

    On the syntactic transformation semigroup of a language generated by a finite biprefix code (English)
    0 references
    0 references
    1982
    0 references
    biprefix code
    0 references
    syntactic transformation semigroup
    0 references
    idempotent
    0 references
    partial one to one maps
    0 references

    Identifiers