On maximal pattern complexity of some automatic words (Q3093792): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Pavel Salimov / rank
Normal rank
 
Property / author
 
Property / author: Pavel Salimov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: 0-1-sequences of Toeplitz type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal pattern complexity for Toeplitz words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetical complexity of symmetric D0L words. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of sequences and dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences of low arithmetical complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toeplitz words, generalized periodicity and periodically iterated morphisms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:53, 4 July 2024

scientific article
Language Label Description Also known as
English
On maximal pattern complexity of some automatic words
scientific article

    Statements

    On maximal pattern complexity of some automatic words (English)
    0 references
    0 references
    0 references
    18 October 2011
    0 references
    maximal pattern complexity of the word
    0 references

    Identifiers