Author:
Petrova Elena A.,Shur Arseny M.
Publisher
Springer International Publishing
Reference14 articles.
1. Bean, D.A., Ehrenfeucht, A., McNulty, G.: Avoidable patterns in strings of symbols. Pac. J. Math. 85, 261–294 (1979)
2. Currie, J.D.: On the structure and extendibility of
$$k$$
-power free words. Eur. J. Comb. 16, 111–124 (1995)
3. Currie, J.D., Shelton, R.O.: The set of
$$k$$
-power free words over
$$\sigma $$
is empty or perfect. Eur. J. Comb. 24, 573–580 (2003)
4. Johnson, D.B.: Finding all the elementary circuits in a directed graph. SIAM J. Comput. 4(1), 77–84 (1975)
5. Lothaire, M.: Combinatorics on Words, Encyclopedia of Mathematics and Its Applications, vol. 17. Addison-Wesley, Reading (1983)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献