Extending Parikh matrices

Authors:
Traian-Florin Şerbanuţa
Affiliations:
Faculty of Mathematics, University of Bucharest, Str. Academiei, 14, Bucharest, Romania
Venue:
Theoretical Computer Science
Year:
2004

Citing 4
Cited 20

Formal languages

Formal languages
Handbook of Formal Languages

Handbook of Formal Languages
On the injectivity of the Parikh matrix mapping

Fundamenta Informaticae
On an Extension of the Parikh Mapping

On an Extension of the Parikh Mapping

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

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
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 occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism

Theoretical Computer Science
Some Alternatives to Parikh Matrices Using String Kernels

Fundamenta Informaticae
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
On the Injectivity of Parikh Matrix Mappings

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Several extensions of the Parikh matrix L-morphism

Journal of Computer and System Sciences

Quantified Score

Hi-index	5.23

Visualization

Abstract

We introduce the notion of Parikh matrix induced by a word, a natural extension to the notion of Parikh matrix and prove a set of properties for this kind of matrices.We also study the relation between these two notions. We show that combining properties from both we obtain a more powerful tool for proving algebraic properties of words.