Subword Balance in BinaryWords, Languages and Sequences

  • Authors:
  • Arto Salomaa

  • Affiliations:
  • Turku Centre for Computer Science, Joukahaisenkatu 3-5 B, 20520 Turku, Finland. E-mail: asalomaa@utu.fi

  • Venue:
  • Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate binary words and languages having a balanced structure of (scattered) subwords. We introduce a "difference function" D for binary words. For D=0, the resulting language is properly context-sensitive. Parikh matrices constitute a useful technical tool in the study, we investigate also the independence of their entries. The investigation is extended to concern ω-words and periodicity. For the Fibonacci word, the D-values are in many ways connected with the Fibonacci numbers.