Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference7 articles.
1. Codifiable languages and the Parikh matrix mapping;Atanasiu;J. Univers. Comput. Sci.,2001
2. On the injectivity of the Parikh matrix mapping;Atanasiu;Fund. Inform.,2002
3. Words and special factors;Carpi;Theoret. Comput. Sci.,2001
4. Matrix indicators for subword occurrences and ambiguity;Mateescu;Internat. J. Found. Comput. Sci.,2004
5. A sharpening of the Parikh mapping;Mateescu;RAIRO Theoret. Inform. Appl.,2001
Cited by
52 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Characterizations of families of morphisms and words via binomial complexities;European Journal of Combinatorics;2024-05
2. Gapped Binomial Complexities in Sequences;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25
3. M-equivalence of Parikh Matrix over a Ternary Alphabet;Implementation and Application of Automata;2023
4. Erasure and error correcting ability of Parikh matrices;Information Processing Letters;2022-04
5. A Toolkit for Parikh Matrices;Implementation and Application of Automata;2022