On infinite prefix normal words

DOI10.1007/978-3-030-10801-4_11zbMath1445.68184arXiv1811.06273OpenAlexW2963716353MaRDI QIDQ5918978

Ferdinando Cicalese, Massimiliano Rossi, Zsuzsanna Lipták

Publication date: 22 October 2020

Published in: SOFSEM 2019: Theory and Practice of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

lexicographic orderSturmian wordsThue-Morse sequenceinfinite wordscombinatorics on wordsabelian complexityprefix normal wordspaperfolding word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (2)

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word ⋮ On infinite prefix normal words

This page was built for publication: On infinite prefix normal words