Semirings, automata, languages
Semirings, automata, languages
Discrete Mathematics
Journal of the ACM (JACM)
Handbook of Formal Languages
Mathematical Theory of L Systems
Mathematical Theory of L Systems
Theoretical Computer Science
Subword histories and Parikh matrices
Journal of Computer and System Sciences
Reconstruction from subsequences
Journal of Combinatorial Theory Series A
Some characterizations of Parikh matrix equivalent binary words
Information Processing Letters
Connections between subwords and certain matrix mappings
Theoretical Computer Science - The art of theory
On Some Problems of Mateescu Concerning Subword Occurrences
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Injectivity of the Parikh Matrix Mappings Revisited
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
On the Injectivity of Parikh Matrix Mappings
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Hi-index | 0.00 |
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.