Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Examples of sequences of complexity less than \(2n\)

From MaRDI portal
Publication:5952897
Jump to:navigation, search

zbMath0994.68099MaRDI QIDQ5952897

Ali Aberkane

Publication date: 14 January 2002

Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)


zbMATH Keywords

Rauzy graphs


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)


Related Items (5)

An isolated point in the Heinis spectrum ⋮ Low complexity subshifts have discrete spectrum ⋮ Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\). ⋮ An explicit lower bound for the block complexity of an algebraic number ⋮ On the complexity function for sequences which are not uniformly recurrent







This page was built for publication: Examples of sequences of complexity less than \(2n\)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5952897&oldid=12117916"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 01:07.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki