Electronic Proceedings in Theoretical Computer Science (May 2014)

Representations of Circular Words

  • László Hegedüs,
  • Benedek Nagy

DOI
https://doi.org/10.4204/EPTCS.151.18
Journal volume & issue
Vol. 151, no. Proc. AFL 2014
pp. 261 – 270

Abstract

Read online

In this article we give two different ways of representations of circular words. Representations with tuples are intended as a compact notation, while representations with trees give a way to easily process all conjugates of a word. The latter form can also be used as a graphical representation of periodic properties of finite (in some cases, infinite) words. We also define iterative representations which can be seen as an encoding utilizing the flexible properties of circular words. Every word over the two letter alphabet can be constructed starting from ab by applying the fractional power and the cyclic shift operators one after the other, iteratively.