Connections between subwords and certain matrix mappings

Authors:
Arto Salomaa
Affiliations:
Turku Centre for Computer Science, Academy of Finland, Turku, Finland
Venue:
Theoretical Computer Science - The art of theory
Year:
2005

Citing 9
Cited 12

Handbook of formal languages, vol. 1: word, language, grammar

Handbook of formal languages, vol. 1: word, language, grammar
On Context-Free Languages

Journal of the ACM (JACM)
Words and special factors

Theoretical Computer Science
Semirings, Automata and Languages

Semirings, Automata and Languages
Forbidden Factors in Finite and Infinite Words

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Extending Parikh matrices

Theoretical Computer Science
Subword histories and Parikh matrices

Journal of Computer and System Sciences
Reconstruction from subsequences

Journal of Combinatorial Theory Series A
Some characterizations of Parikh matrix equivalent binary words

Information Processing Letters

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
Subword histories and associated matrices

Theoretical Computer Science
On highly palindromic words

Discrete Applied Mathematics
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
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

Parikh matrices recently introduced have turned out to be a powerful tool in the arithmetizing of the theory of words. In particular, many inequalities between (scattered) subword occurrences have been obtained as consequences of the properties of the matrices. This paper continues the investigation of Parikh matrices and subword occurrences. In particular, we study certain inequalities, as well as information about subword occurrences sufficient to determine the whole word uniquely. Some algebraic considerations, facts about forbidden subwords, as well as some open problems are also included.