Author:
Glaßer Christian,Schmitz Heinz
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference27 articles.
1. Lecture Notes in Computer Science;M. Arfi,1987
2. Arfi, M.: Opérations polynomiales et hiérarchies de concaténation. Theor. Comput. Sci. 91, 71–84 (1991)
3. Brzozowski, J.A., Knast, R.: The dot-depth hierarchy of star-free languages is infinite. J. Comput. Syst. Sci. 16, 37–55 (1978)
4. Cohen, R.S., Brzozowski, J.A.: Dot-depth of star-free events. J. Comput. Syst. Sci. 5, 1–16 (1971)
5. Eilenberg, S.: Automata, Languages and Machines, vol. B. Academic, New York (1976)
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献