Author:
Ehrenfeucht A.,Rozenberg G.
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference6 articles.
1. On the subword complexity of square-free DOL languages;Ehrenfeucht;Theoret. Comput. Sci.,1981
2. On the subword complexity of DOL languages with a constant distribution;Ehrenfeucht;Inform. Process. Lett.,1981
3. Subwords of developmental languages;Lee,1975
4. On subwords of formal languages;Rozenberg,1981
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Preface;Theoretical Computer Science;2012-04
2. Subword complexity of uniform D0L words over finite groups;Theoretical Computer Science;2011-09
3. On the D0L Repetition Threshold;RAIRO - Theoretical Informatics and Applications;2010-06-23
4. Asymptotic subword complexity of fixed points of group substitutions;Theoretical Computer Science;2009-05
5. The Lempel–Ziv Complexity of Fixed Points of Morphisms;SIAM Journal on Discrete Mathematics;2007-01