Semirings, automata, languages
Semirings, automata, languages
Discrete Mathematics
Journal of the ACM (JACM)
Handbook of Formal Languages
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
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
On the Injectivity of the Parikh Matrix Mapping
Fundamenta Informaticae
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
Hi-index | 0.00 |
The paper investigates inference based on quantities |W|$_u$, the number of occurrences of a word u as a scattered subword of W. Parikh matrices recently introduced are useful tools for such investigations. We introduce and study universal languages for Parikh matrices. We also obtain results concerning the inference from numbers |W|$_u$ to W, as well as from certain entries of a Parikh matrix to other entries.