Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms (Q2381820): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2007.04.024 / rank
Normal rank
 
Property / author
 
Property / author: Gwenaël Richomme / rank
Normal rank
 
Property / author
 
Property / author: Francis Wlazinski / rank
Normal rank
 
Property / author
 
Property / author: Gwenaël Richomme / rank
 
Normal rank
Property / author
 
Property / author: Francis Wlazinski / 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/j.dam.2007.04.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001169694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoidable patterns in strings of symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth of repetition-free words -- a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4430300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of overlap-free morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp characterizations of squarefree morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4151737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-repetition freeness of length uniform morphisms over a binary alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: If a DOL language is k-power free then it is circular / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some non finitely generated monoids of repetition-free endomorphisms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of test-sets for overlap-free morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on \(k\)-power-free morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Overlap-free morphisms and finite test-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A test-set for<i>k</i>-power-free binary morphisms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2007.04.024 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:34, 18 December 2024

scientific article
Language Label Description Also known as
English
Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms
scientific article

    Statements

    Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms (English)
    0 references
    19 September 2007
    0 references
    Formal languages
    0 references
    combinatorics on words
    0 references
    \(k\)-power-free words
    0 references
    morphisms
    0 references
    test-sets
    0 references
    0 references
    0 references

    Identifiers