References
- Atanasiu , A. 2007 . Binary amiable words . Internat. J. Found. Comput. Sci. , 18 ( 2 ) : 387 – 400 . (doi:10.1142/S0129054107004735)
- Atanasiu , A. 2010 . Morphisms on amiable words . An. Univ. Bucureşti Mat. Inform. LIX , : 99 – 111 .
- Atanasiu , R. F. 2010 . Parikh matrix mapping and languages . Internat. J. Found. Comput. Sci. (IJFCS) , 21 ( 6 ) : 993 – 1004 . (doi:10.1142/S0129054110007684)
- Atanasiu , A. , Martin-Vide , C. and Mateescu , Al. 2001 . On the injectivity of Parikh matrix mapping . Fund. Inform. , 49 : 166 – 180 .
- Atanasiu , A. , Atanasiu , R. and Petre , I. 2008 . Parikh matrices and amiable words . TCS , 390 ( 1 ) : 102 – 109 . (doi:10.1016/j.tcs.2007.10.022)
- Ding , C. and Salomaa , A. 2006 . On some problems of Mateescu concerning subword occurrences . Fund. Inform. , 73 : 65 – 79 .
- Fosse , S. and Richmomme , G. 2004 . Some characterisations of Parikh matrix equivalent binary words . Inform. Process. Lett. , 92 ( 2 ) : 77 – 82 . (doi:10.1016/j.ipl.2004.06.011)
- Mateescu , Al. and Salomaa , A. 2004 . Matrix indicators for subword occurrences and ambiguity . Internat. J. Found. Comput. Sci. , 15 : 277 – 292 . (doi:10.1142/S0129054104002418)
- Mateescu , Al. , Salomaa , A. , Salomaa , K. and Yu , S. 2001 . On the extension of the Parikh mapping . Theoret. Inform. Appl. , 35 : 551 – 564 . (doi:10.1051/ita:2001131)
- Parikh , R. J. 1966 . On context-free languages . J. Assoc. Comput. Mach. , 13 : 570 – 581 . (doi:10.1145/321356.321364)
- Salomaa , A. 2005 . Connections between subwords and certain matrix mappings . Theoret. Comput. Sci. , 340 : 188 – 203 . (doi:10.1016/j.tcs.2005.03.024)
- Salomaa , A. 2006 . Independence of certain quantities indicating subword occurrences . Theoret. Comput. Sci. , 362 ( 1 ) : 222 – 231 . (doi:10.1016/j.tcs.2006.06.025)
- Salomaa , A. 2008 . Subword histories and associated matrices . Theoret. Comput. Sci. , 407 : 250 – 257 . (doi:10.1016/j.tcs.2008.05.023)
- Salomaa , A. 2010 . Criteria for matrix equivalence of words . Theoret. Comput. Sci. , 411 : 1818 – 1827 . (doi:10.1016/j.tcs.2010.01.036)
- Şerbănuţă , V. 2009 . On Parikh matrices, ambiguity, and prints . Internat. J. Found. Comput. Sci. , 20 ( 1 ) : 151 – 165 . (doi:10.1142/S0129054109006498)
- Available at http://en.wikipedia.org/wiki/Egyptian_fraction.
- Available at wikipedia.org/wiki/Greedy_algorithm_for_Egyptian_fractions.