Parikh Prime Words and GO-like Territories
暂无分享,去创建一个
Gheorghe Paun | Grzegorz Rozenberg | Arto Salomaa | Alexandru Mateescu | G. Paun | G. Rozenberg | A. Salomaa | A. Mateescu
[1] M. Lothaire. Combinatorics on words: Bibliography , 1997 .
[2] Gheorghe Paun,et al. Thin and Slender Languages , 1995, Discret. Appl. Math..
[3] Masami Ito,et al. Formal Languages Consisting of Primitive Words , 1993, FCT.
[4] Masami Ito,et al. Context-free languages consisting of non-primitive words , 1991, Int. J. Comput. Math..
[5] Gheorghe Paun,et al. Regulated Rewriting in Formal Language Theory , 1989 .
[6] Arto Salomaa,et al. Formal languages , 1973, Computer science classics.
[7] E. Berlekamp,et al. Winning Ways for Your Mathematical Plays , 1983 .
[8] Karl Winklmann,et al. Repetitive Strings are not Context-Free , 1982, RAIRO Theor. Informatics Appl..
[9] R. Guy. Unsolved Problems in Number Theory , 1981 .
[10] Grzegorz Rozenberg,et al. The mathematical theory of L systems , 1980 .
[11] Maurice Nivat,et al. Quelques problèmes ouverts en théorie des langages algébriques , 1979, RAIRO Theor. Informatics Appl..
[12] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .