Author:
Ehrenfeucht A.,Rozenberg G.
Reference10 articles.
1. 1. AUTEBERT J. M., BEAUQUIER J., BOASSON L. and NIVAT M., Quelques problèmes ouverts en théorie des langages algébrique, RAIRO Informatique Théorique, vol. 13, 1979, p. 363-379.921105569580434.68056
2. 2. BERSTEL J., Sur les mots sans carré définis par un morphism, Lecture Notes in Computer Science, Springer-Verlag, vol. 71, 1979, p. 16-25.5732320425.20046
3. 3. BEAN D. R., EHRENFEUCHT A. and MCNULTY G. F., Avoidable patterns in strings of symbols, Pacific Journal of Mathematics, vol. 85, n° 2, 1979, p. 261-294.5749190428.05001
4. 4. EHRENFEUCHT A. and ROZENBERG G., On the subword complexity of square-free DOL languages, Theoretical Computer Science, to appear.6326680481.68073
5. 5. HARRISON M., Introduction to formal language theory, Addison-Wesley, Reading, Massachusetts, 1978.5263970411.68058
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Most Pseudo-copy Languages Are Not Context-Free;Lecture Notes in Computer Science;2021
2. Prefix–suffix duplication;Journal of Computer and System Sciences;2014-11
3. Bounded Prefix-Suffix Duplication;Implementation and Application of Automata;2014
4. On weak circular squares in binary words;Combinatorial Pattern Matching;1997
5. Open Problems in Pattern Avoidance;The American Mathematical Monthly;1993-10