Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
Automata, Languages, and Machines
Automata, Languages, and Machines
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
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
Parikh matrices and amiable words
Theoretical Computer Science
Subword histories and associated matrices
Theoretical Computer Science
Restricted k-ary words and functional equations
Discrete Applied Mathematics
Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
Theoretical Computer Science
| Hi-index | 5.24 |
This paper investigates the criteria for deciding whether two words are matrix equivalent. Certain upper diagonal matrices, generally referred to as the Parikh matrices, have been widely investigated because of their usefulness in computing the numbers of subword occurrences and thereby characterizing words by numbers. However, apart from the binary alphabet, not much is known about the properties of the matrix equivalent words, that is, words possessing the same matrix. The paper investigates both the general criteria, as well as the criteria valid in natural special cases. An exhaustive solution is obtained for ternary alphabets.