Applications of an Infinite Square-Free CO-CFL
暂无分享,去创建一个
[1] G. Rozenberg,et al. Pumping Lemmas for Regular Sets , 1981, SIAM J. Comput..
[2] Maurice Nivat,et al. Quelques problèmes ouverts en théorie des langages algébriques , 1979, RAIRO Theor. Informatics Appl..
[3] Jean Berstel,et al. Sur les mots sans carré définis par un morphisme , 1979, ICALP.
[4] Michael G. Main,et al. An Infinite Square-Free co-CFL , 1985, Inf. Process. Lett..
[5] Luc Boasson,et al. A Note on 1-Locally Linear Languages , 1978, Inf. Control..
[6] Dwight R. Bean,et al. Avoidable patterns in strings of symbols , 1979 .
[7] Andries P.J. van der Walt,et al. Locally Linear Families of Languages , 1976, Inf. Control..
[8] Jean Berstel,et al. Mots sans carre et morphismes iteres , 1980, Discret. Math..
[9] J. Beauquier,et al. VERY SMALL FAMILIES OF ALGEBRAIC NONRATIONAL LANGUAGES , 1980 .
[10] Michael G. Main,et al. Permutations Are Not Context-Free: An Application of the Interchange Lemma , 1982, Inf. Process. Lett..
[11] Antonio Restivo,et al. Rational Languages and the Burnside Problem , 1985, Theor. Comput. Sci..
[12] David Haussler,et al. On Total Regulators Generated by Derivation Relations , 1985, Theor. Comput. Sci..
[13] Andrzej Szepietowski. There are no Fully Space Constructible Functions Between log log n and log n , 1987, Inf. Process. Lett..
[14] Joaquim Gabarró. Some applications of the interchange lemma , 1985, Bull. EATCS.
[15] Luc Boasson,et al. Un critère de rationnalité des langages algébriques , 1972, ICALP.
[16] Arto Salomaa,et al. Formal languages , 1973, Computer science classics.
[17] P. Pleasants. Non-repetitive sequences , 1970, Mathematical Proceedings of the Cambridge Philosophical Society.
[18] Jean Berstel. Every Iterated Morphism Yields a co-CFL , 1986, Inf. Process. Lett..