Codes générateurs minimaux de langages de mots bi-infinis (Q2729633): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jeanne Devolder / rank
Normal rank
 
Property / author
 
Property / author: Jeanne Devolder / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972079096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitely generated bi\(\omega\)-languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitary codes for biinfinite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precircular codes and periodic biinfinite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular codes and synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prefix-free languages as \(\omega\)-generators / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:37, 3 June 2024

scientific article
Language Label Description Also known as
English
Codes générateurs minimaux de langages de mots bi-infinis
scientific article

    Statements

    Codes générateurs minimaux de langages de mots bi-infinis (English)
    0 references
    0 references
    23 July 2001
    0 references
    0 references
    synchronous codes
    0 references
    bi-infinite words
    0 references
    minimal generator
    0 references
    precircular codes
    0 references
    very thin codes
    0 references
    circular codes
    0 references
    rational codes
    0 references
    0 references
    0 references