Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference19 articles.
1. J.I. Seiferas, Untitled manuscript, communicated to M. Sipser, October 1973.
2. W.J. Sakoda, M. Sipser, Nondeterminism and the size of two-way finite automata, in: Proceedings of the Symposium on the Theory of Computing, 1978, pp. 275–286.
3. Lower bounds on the size of sweeping automata;Sipser;J. Comput. System Sci.,1980
4. Tight lower bounds on the size of sweeping automata;Leung;J. Comput. System Sci.,2001
5. J. Hromkovič, G. Schnitger, Nondeterminism versus determinism for two-way finite automata: generalizations of Sipserʼs separation, in: Proceedings of the International Colloquium on Automata, Languages, and Programming, 2003, pp. 439–451.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献