On fairness of D0L systems

Authors:
Anton erný
Affiliations:
Department of Mathematics and Computer Science, Kuwait University, P.O. Box 5969, Safat 13060, Kuwait
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 4
Cited 4

On Context-Free Languages

Journal of the ACM (JACM)
Subword histories and Parikh matrices

Journal of Computer and System Sciences
Some characterizations of Parikh matrix equivalent binary words

Information Processing Letters
Subword Balance in BinaryWords, Languages and Sequences

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak

Subword histories and associated matrices

Theoretical Computer Science
Criteria for the matrix equivalence of words

Theoretical Computer Science
Subword balance, position indices and power sums

Journal of Computer and System Sciences
Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism

Theoretical Computer Science

Quantified Score

Hi-index	0.05

Visualization

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.