Words that almost commute
From MaRDI portal
Publication:2138989
DOI10.1016/J.DISC.2022.112898OpenAlexW3201662897MaRDI QIDQ2138989FDOQ2138989
Authors: Daniel Gabric
Publication date: 17 May 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.01120
finite Sturmian wordsalmost commutative wordsconjugate Hamming distancefine-Wilf pairsLyndon conjugatesLyndon-Schutzenberger
Discrete mathematics in relation to computer science (68Rxx) Semigroups (20Mxx) Theory of error-correcting codes and error-detecting codes (94Bxx)
Cites Work
- Error Detecting and Error Correcting Codes
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Title not available (Why is that?)
- Uniqueness Theorems for Periodic Functions
- Some combinatorial properties of Sturmian words
- The structures of bad words
- Asymptotic number of isometric generalized Fibonacci cubes
- A characterization of non-isometric binary words
- Hamming distance for conjugates
Cited In (1)
This page was built for publication: Words that almost commute
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138989)