On the Injectivity of Parikh Matrix Mappings

Authors:
Arto Salomaa
Affiliations:
(Correspd.) Turku Centre for Computer Science, Lemminkäisenkatu 14, 20520 Turku, Finland. asalomaa@it.utu.fi
Venue:
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Year:
2005

Citing 6
Cited 4

Semirings, automata, languages

Semirings, automata, languages
On Context-Free Languages

Journal of the ACM (JACM)
Words and special factors

Theoretical Computer Science
Handbook of Formal Languages

Handbook of Formal Languages
Extending Parikh matrices

Theoretical Computer Science
Subword histories and Parikh matrices

Journal of Computer and System Sciences

Independence of certain quantities indicating subword occurrences

Theoretical Computer Science
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.00

Visualization

Abstract

We investigate the number of (scattered) subword occurrences and Parikh matrices, especially the case where the matrix determines the word uniquely. A condition introduced in this paper, called γ-property, turns out to be a powerful tool for such unambiguous matrices. Interconnections with the general theory of subword histories are also pointed out.