Semirings, automata, languages
Semirings, automata, languages
Discrete Mathematics
Handbook of formal languages, vol. 1: word, language, grammar
Handbook of formal languages, vol. 1: word, language, grammar
Journal of the ACM (JACM)
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 the Injectivity of Parikh Matrix Mappings
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
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
Discrete Applied Mathematics
Subword histories and associated matrices
Theoretical Computer Science
Journal of Automata, Languages and Combinatorics
Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
Theoretical Computer Science
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.