Permutation Complexity Related to the Letter Doubling Map
From MaRDI portal
Publication:2789537
DOI10.4204/EPTCS.63.33zbMath1331.68179arXiv1108.3642OpenAlexW2152952500MaRDI QIDQ2789537
Publication date: 1 March 2016
Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.3642
Related Items (2)
Canonical Representatives of Morphic Permutations ⋮ Minimal complexity of equidistributed infinite permutations
This page was built for publication: Permutation Complexity Related to the Letter Doubling Map
