Independence of certain quantities indicating subword occurrences
暂无分享,去创建一个
[1] Grzegorz Rozenberg,et al. Handbook of formal languages, vol. 3: beyond words , 1997 .
[2] Paul K. Stockmeyer,et al. Reconstruction of sequences , 1991, Discret. Math..
[3] M. Lothaire. Combinatorics on words: Bibliography , 1997 .
[4] Traian-Florin Serbanuta,et al. Injectivity of the Parikh Matrix Mappings Revisited , 2006, Fundam. Informaticae.
[5] Arto Salomaa,et al. Subword conditions and subword histories , 2006, Inf. Comput..
[6] Arto Salomaa. Counting (scattered) Subwords , 2003, Bull. EATCS.
[7] Arto Salomaa,et al. Subword histories and Parikh matrices , 2004, J. Comput. Syst. Sci..
[8] Miroslav Dudík,et al. Reconstruction from subsequences , 2003, J. Comb. Theory A.
[9] Gwénaël Richomme,et al. Some characterizations of Parikh matrix equivalent binary words , 2004, Inf. Process. Lett..
[10] Arto Salomaa,et al. Semirings, Automata, Languages , 1985, EATCS Monographs on Theoretical Computer Science.
[11] Arto Salomaa. On Languages Defined by Numerical Parameters , 2007, Formal Models, Languages and Applications.
[12] Traian-Florin Serbanuta. Extending Parikh matrices , 2004, Theor. Comput. Sci..
[13] Arto Salomaa. On the Injectivity of Parikh Matrix Mappings , 2005, Fundam. Informaticae.
[14] Arto Salomaa,et al. Matrix Indicators For Subword Occurrences And Ambiguity , 2004, Int. J. Found. Comput. Sci..
[15] Arto Salomaa. Connections between subwords and certain matrix mappings , 2005, Theor. Comput. Sci..
[16] Rohit Parikh,et al. On Context-Free Languages , 1966, JACM.
[17] Arto Salomaa,et al. A sharpening of the Parikh mapping , 2001, RAIRO Theor. Informatics Appl..
[18] Cunsheng Ding,et al. On Some Problems of Mateescu Concerning Subword Occurrences , 2006, Fundam. Informaticae.
[19] Grzegorz Rozenberg,et al. Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.