Abstract
We investigate binary words and ω-words, mainly those generated by D0L systems. We compare the numbers of occurrences of ab and ba as (scattered) subwords by introducing a 'difference function'. Of special interest are the 'balanced' or 'fair' words for which the function assumes the value 0. If the three first words in a D0L sequence are fair, so are all words in the sequence. Two kinds of matrices constitute a useful technical tool in the study. An explicit formula, leading to various consequences, is obtained for the difference function.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
