@InProceedings{jordon_et_al:LIPIcs.FSTTCS.2021.47,
author = {Jordon, Liam and Moser, Philippe},
title = {{Normal Sequences with Non-Maximal Automatic Complexity}},
booktitle = {41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021)},
pages = {47:1--47:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-215-0},
ISSN = {1868-8969},
year = {2021},
volume = {213},
editor = {Boja\'{n}czyk, Miko{\l}aj and Chekuri, Chandra},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2021.47},
URN = {urn:nbn:de:0030-drops-155580},
doi = {10.4230/LIPIcs.FSTTCS.2021.47},
annote = {Keywords: Automatic Complexity, finite-state complexity, normal sequences, Champernowne sequences, de Bruijn strings, Kolmogorov complexity}
}