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
Discussion
View source
View history
Purge
English
Log in

The Maximal Subword Complexity of Quasiperiodic Infinite Words

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

zbMath1455.68155arXiv1008.1659MaRDI QIDQ4964023

Ludwig Staiger, Ronny Polley

Publication date: 24 February 2021

Full work available at URL: https://arxiv.org/abs/1008.1659


zbMATH Keywords

structure-generating functionquasiperiodic wordscodes, subword complexity


Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)


Related Items (2)

Coverability and multi-scale coverability on infinite pictures ⋮ Coverability in Two Dimensions







This page was built for publication: The Maximal Subword Complexity of Quasiperiodic Infinite Words

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4964023&oldid=19392318"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 08:39.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki