Automata, Languages, and Machines
Automata, Languages, and Machines
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
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
Independence of certain quantities indicating subword occurrences
Theoretical Computer Science
Subword conditions and subword histories
Information and Computation
The origins of combinatorics on words
European Journal of Combinatorics
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 occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, we investigate various ways of characterizing words, mainly over a binary alphabet, using information about the positions of occurrences of letters in words. We introduce two new measures associated with words, the position index and sum of position indices. We establish some characterizations, connections with Parikh matrices, and connections with power sums. One particular emphasis concerns the effect of morphisms and iterated morphisms on words.