Author:
Geffert Viliam,Okhotin Alexander
Publisher
Springer International Publishing
Reference15 articles.
1. Barnes, B.: A two-way automaton with fewer states than any equivalent one-way automaton. IEEE Trans. Comput. C-20, 474–475 (1971)
2. Geffert, V., Mereghetti, C., Pighizzini, G.: Converting two-way nondeterministic unary automata into simpler automata. Theoret. Comput. Sci. 295, 189–203 (2003)
3. Geffert, V., Okhotin, A.: One-way simulation of two-way finite automata over small alphabets. In: Proceedings of Non-Classical Models of Automata & Application, pp. 151–162. Österreichische Comput. Gesellschaft (2013)
4. Lecture Notes in Computer Science;V Geffert,2014
5. Lecture Notes in Computer Science;C Kapoutsis,2005
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Homomorphisms and inverse homomorphisms on graph-walking automata;Theoretical Computer Science;2023-11
2. Sweeping Permutation Automata;Electronic Proceedings in Theoretical Computer Science;2023-09-15
3. Homomorphisms on Graph-Walking Automata;Implementation and Application of Automata;2022