Author:
Dick Jeffery,Hutchinson Laura K.,Mercaş Robert,Reidenbach Daniel
Publisher
Springer International Publishing
Reference20 articles.
1. Alazemi, H.M.K., Černý, A.: Counting subwords using a trie automaton. Int. J. Found. Comput. Sci. 22(6), 1457–1469 (2011)
2. Alazemi, H.M.K., Černý, A.: Several extensions of the Parikh matrix L-morphism. J. Comput. Syst. Sci. 79(5), 658–668 (2013)
3. Atanasiu, A.: Parikh matrix mapping and amiability over a ternary alphabet. In: Discrete Mathematics and Computer Science, pp. 1–12 (2014)
4. Atanasiu, A., Atanasiu, R., Petre, I.: Parikh matrices and amiable words. Theoret. Comput. Sci. 390(1), 102–109 (2008)
5. Atanasiu, A., Martín-Vide, C., Mateescu, A.: Codifiable languages and the Parikh matrix mapping. J. UCS 7, 783–793 (2001)