Author:
Kobayashi Yuji,Otto Friedrich,Séébold Patrice
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. J. Berstel. Every iterated morphism yields a co-CFL. Information Processing Letters, 22:7–9, 1986.
2. A. Ehrenfeucht and G. Rozenberg. Repetition of subwords in DOL languages. Information and Control, 59:13–35, 1983.
3. T. Harju and M. Linna. The equations h(w) = w
n in binary alphabets. Theoretical Computer Science, 33:327–329, 1984.
4. T. Head and B. Lando. Periodic DOL languages. Theoretical Computer Science, 46:83–89, 1986.
5. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory; Languages; and Computation. Addison-Wesley, Reading, M.A., 1979.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献