Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference10 articles.
1. Baker, K.A., McNulty, G.F., Taylor, W.: Growth problems for avoidable words. Theoret. Comput. Sci.69, 319?345 (1989)
2. Bean, D.R., Ehrenfeucht, A., McNulty, G.F.: Avoidable patterns in strings of symbols. Pac. J. Math.85, 261?294 (1979)
3. Lothaire, M.: Combinatorics on words, vol. 17. Encyclopedia of mathematics and its applications. Reading: Addison-Wesley 1983
4. Roth, P.: Every binary pattern of length six is avoidable on the two-letter alphabet. Acta Inf.29, 95?106 (1992)
5. Salomaa, A.: Jewels of formal language theory. Oxford: Computer Science Press 1981
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献