Some characterizations of Parikh matrix equivalent binary words

Authors:
S. Fossé;G. Richomme
Affiliations:
LaRIA, Université de Picardie Jules Verne, 33, rue Saint Leu, F-80039 Amiens Cedex 01, France;LaRIA, Université de Picardie Jules Verne, 33, rue Saint Leu, F-80039 Amiens Cedex 01, France
Venue:
Information Processing Letters
Year:
2004

Citing 3
Cited 16

Words and special factors

Theoretical Computer Science
On the injectivity of the Parikh matrix mapping

Fundamenta Informaticae
Subword histories and Parikh matrices

Journal of Computer and System Sciences

Connections between subwords and certain matrix mappings

Theoretical Computer Science - The art of theory
Independence of certain quantities indicating subword occurrences

Theoretical Computer Science
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
Subword Balance in BinaryWords, Languages and Sequences

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
On fairness of D0L systems

Discrete Applied Mathematics
Parikh matrices and amiable words

Theoretical Computer Science
Subword histories and associated matrices

Theoretical Computer Science
Scattered subword complexity of non-primitive words

Journal of Automata, Languages and Combinatorics
Criteria for the matrix equivalence of words

Theoretical Computer Science
Subword balance, position indices and power sums

Journal of Computer and System Sciences
On fair words

Journal of Automata, Languages and Combinatorics
Binary images, M-vectors, and ambiguity

IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Subword Balance in BinaryWords, Languages and Sequences

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
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

Quantified Score

Hi-index	0.90

Visualization

Abstract

We state different characterizations of pair of words having the same Parikh matrix.