Injectivity of the Parikh Matrix Mappings Revisited

Authors:
Virgil Nicolae Şerbănuţă;Traian Florin Şerbănuţă
Affiliations:
Faculty of Mathematics and Informatics University of Bucharest Academiei 14, sector 1, 010014 Bucharest, Romania. E-mail: serbanutav@gmail.com;-
Venue:
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Year:
2006

Citing 10
Cited 6

Formal languages

Formal languages
On Context-Free Languages

Journal of the ACM (JACM)
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
Extending Parikh matrices

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

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus

Subword Balance in BinaryWords, Languages and Sequences

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Subsequence Invariants

CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Subword histories and associated matrices

Theoretical Computer Science
Criteria for the matrix equivalence of words

Theoretical Computer Science
Subword balance, position indices and power sums

Journal of Computer and System Sciences
Binary images, M-vectors, and ambiguity

IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

We deal with the notion of M-unambiguity [5] in connection with the Parikh matrix mapping introduced by Mateescu and others in [7]. M-unambiguity is studied both in terms of words and matrices and several sufficient criteria for M-unambiguity are provided in both cases, nontrivially generalizing the criteria based on the γ-property introduced by Salomaa in [15]. Also, the notion of M-unambiguity with respect to a word is defined in connection with the extended Parikh matrix morphism [16] and some of the M-unambiguity criteria are lifted from the classical setting to the extended one. This paper is a revised and extended version of [17].