Reference39 articles.
1. J. M. Autebert, J. Beauquier, L. Boasson, M. Nivat, Quelques problèmes ouverts en théorie des langages, RAIRO Informatique théorique13 (1979), 363–379.
2. J. M. Autebert, P. Flajolet, J. Gabarró, Prefixes of infinite words and ambiguous context-free languages, Inform. Proc. Letters25 (1987), 211–216.
3. J. M. Autebert, J. Gabarró, Iterated gsm's and co-cfl, Acta Informatica, to appear.
4. C. Bader, A. Moura, A generalization of Ogden's lemma, J. Assoc. Comput. Mach.29 (1982), 404–407.
5. J. Berstel, Mots de Fibonacci, Séminaire d'informatique théorique, LITP, Paris, Année 1980/81, 57–78.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Infinite Words Determined by L Systems;Lecture Notes in Computer Science;2013
2. Combinatorics of Words;Handbook of Formal Languages;1997
3. Context-Free Languages;Formal Models and Semantics;1990