Maximal pattern complexity of higher dimensional words (Q965228): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcta.2009.07.002 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Discrete planes, \({\mathbb Z}^2\)-actions, Jacobi-Perron algorithm and substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2711280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2731274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal pattern complexity for Toeplitz words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal pattern complexity of two-dimensional words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language structure of pattern Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two dimensional word with \(2k\) maximal pattern complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence entropy and the maximal pattern complexity of infinite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal pattern complexity for discrete systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics on patterns of a bidimensional Sturmian sequence / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCTA.2009.07.002 / rank
 
Normal rank

Latest revision as of 10:17, 10 December 2024

scientific article
Language Label Description Also known as
English
Maximal pattern complexity of higher dimensional words
scientific article

    Statements

    Identifiers