Generalizations of Parikh mappings
RAIRO-Theor. Inf. Appl., 44 2 (2010) 209-228
Published online: 2009-12-16
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Parikh matrices for powers of words
Adrian Atanasiu, Ghajendran Poovanandran and Wen Chean TehActa Informatica 56 (6) 521 (2019)
https://doi.org/10.1007/s00236-018-0327-8
11682 68 (2019)
https://doi.org/10.1007/978-3-030-28796-2_5
Solutions to the multi-dimensional Prouhet–Tarry–Escott problem resulting from composition of balanced morphisms
Anton ČernýInformation and Computation 253 424 (2017)
https://doi.org/10.1016/j.ic.2016.06.008
Language and Automata Theory and Applications
Anton ČernýLecture Notes in Computer Science, Language and Automata Theory and Applications 8370 273 (2014)
https://doi.org/10.1007/978-3-319-04921-2_22
On Prouhet’s solution to the equal powers problem
Anton ČernýTheoretical Computer Science 491 33 (2013)
https://doi.org/10.1016/j.tcs.2013.04.001
Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
Arto SalomaaTheoretical Computer Science 432 85 (2012)
https://doi.org/10.1016/j.tcs.2012.01.017
COUNTING SUBWORDS USING A TRIE AUTOMATON
HAMED M. K. ALAZEMI and ANTON ČERNÝInternational Journal of Foundations of Computer Science 22 (06) 1457 (2011)
https://doi.org/10.1142/S0129054111008817
Subword balance, position indices and power sums
Arto SalomaaJournal of Computer and System Sciences 76 (8) 861 (2010)
https://doi.org/10.1016/j.jcss.2010.04.012