Publisher
Springer Berlin Heidelberg
Reference3 articles.
1. Berman P. and A. Lingas, On the complexity of regular languages in terms of finite automata, ICS PAS Report no 304, 1977, Warszawa.
2. Sakoda W.J. and M. Sipser, Nondeterminism and the size of two-way finite automata, Tenth Annual STOC, 1978.
3. Sipser M., Lower Bounds on the size of sweeping automata, Eleventh Annual ACM Symposium on Theory of Computing, May 1979.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Hot Current Topics of Descriptional Complexity;IFIP Advances in Information and Communication Technology;2021
2. On the Size of Two-Way Reasonable Automata for the Liveness Problem;Developments in Language Theory;2015
3. Two-Way Finite Automata: Old and Recent Results;Electronic Proceedings in Theoretical Computer Science;2012-08-13
4. Size complexity of rotating and sweeping automata;Journal of Computer and System Sciences;2012-03
5. Two-Way Automata Making Choices Only at the Endmarkers;Language and Automata Theory and Applications;2012