Enumeration formula for \((2,n)\)-cubes in discrete planes (Q713312): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the number of digital straight line segments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4951148 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4263845 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of factors of Sturmian words / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sequences with subword complexity \(2n\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4370356 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Local configurations in a discrete plane / rank | |||
Normal rank |
Revision as of 19:09, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Enumeration formula for \((2,n)\)-cubes in discrete planes |
scientific article |
Statements
Enumeration formula for \((2,n)\)-cubes in discrete planes (English)
0 references
26 October 2012
0 references
discrete planes
0 references
local configurations
0 references
Rote sequences
0 references
Berstel-Pocchiola diagrams
0 references