Une généralisation des théorèmes de Higman et de Simon aux mots infinis (Q1062465): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Alain Finkel / rank
Normal rank
 
Property / author
 
Property / author: Alain Finkel / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(85)90216-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015148487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of well-quasi-ordering: a frequently discovered concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5337204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial well‐ordering of sets of vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077455 / rank
 
Normal rank

Latest revision as of 17:39, 14 June 2024

scientific article
Language Label Description Also known as
English
Une généralisation des théorèmes de Higman et de Simon aux mots infinis
scientific article

    Statements

    Une généralisation des théorèmes de Higman et de Simon aux mots infinis (English)
    0 references
    1985
    0 references
    We prove that from an infinite sequence of finite or infinite words on a finite alphabet one can extract an increasing subsequence for the quasi- order 'be a subword of'; that is, the extension of Higman's theorem to infinite words. Then we generalize Simon's theorem for infinite words.
    0 references
    quasi-order
    0 references
    subword
    0 references
    infinite words
    0 references
    0 references

    Identifiers