Maximal pattern complexity of two-dimensional words (Q2503281): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Balance properties of multi-dimensional words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattices and multi-dimensional words / 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: On a conjecture on bidimensional words. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal pattern complexity of words over \(\ell\) letters / 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: Local Complexity of Delone Sets and Crystallinity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rectangle complexity of functions on two-dimensional lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics on patterns of a bidimensional Sturmian sequence / rank
 
Normal rank

Latest revision as of 19:22, 24 June 2024

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

    Statements

    Identifiers