Publisher
Springer International Publishing
Reference7 articles.
1. Lecture Notes in Computer Science;C Damm,1995
2. Fischer, P.C., Rosenberg, A.L.: Multitape one-way nonwriting automata. J. Comput. Syst. Sci. 2(1), 88–101 (1968)
3. Freivalds, R.: Amount of nonconstructivity in deterministic finite automata. Theor. Comput. Sci. 411(38–39), 3436–3443 (2010)
4. Ibarra, O.H., Ravikumar, B.: Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties. Math. Syst. Theory 21(1), 1–17 (1988)
5. Karp, R.M., Lipton, R.J.: Turing machines that take advice. Enseign. Math. 28(2), 191–209 (1982)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Two-Way Non-Uniform Finite Automata;International Journal of Foundations of Computer Science;2022-12-12
2. Advice hierarchies among finite automata;Information and Computation;2022-10
3. Two-Way Non-uniform Finite Automata;Developments in Language Theory;2021
4. Limited Two-Way Deterministic Finite Automata with Advice;Language and Automata Theory and Applications;2020