Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference10 articles.
1. P. Berman, A note on sweeping automata, in Proceedings, 7th ICALP, 1980, Lecture Notes in Computer Science, Vol. 85, pp. 91–97, Springer-Verlag, Berlin/New York.
2. Finite automata and unary languages;Chrobak;Theoret. Comput. Sci.,1986
3. Introduction to Automata Theory, Languages and Computation;Hopcroft,1979
4. Separating exponentially ambiguous finite automata from polynomially ambiguous finite automata;Leung;SIAM J. Comput.,1998
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献