Elsevier

Discrete Applied Mathematics

Volume 155, Issue 13, 15 August 2007, Pages 1769-1773
Discrete Applied Mathematics

On fairness of D0L systems

https://doi.org/10.1016/j.dam.2007.04.004Get rights and content
Under an Elsevier user license
open archive

Abstract

A word is called fair if it contains, for each pair of distinct symbols a,b, the same number of occurrences of the scattered subword ab as of ba. We prove that if the first k+1 words in the sequence generated by a D0L system over a k-letter alphabet are fair then all words in the sequence are fair.

Keywords

Parikh mapping
D0L system
Fair word

Cited by (0)

Communicated by Arto Salomaa.