Author:
Küçük Uğur,Say A. C. Cem,Yakaryılmaz Abuzer
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Karp, R., Lipton, R.: Turing machines that take advice. L’Enseignement Mathematique 28, 191–209 (1982)
2. Lecture Notes in Computer Science;C. Damm,1995
3. Tadaki, K., Yamakami, T., Lin, J.C.H.: Theory of one-tape linear-time Turing machines. Theoretical Computer Science 411(1), 22–43 (2010)
4. Dwork, C., Stockmeyer, L.: Finite state verifiers I: The power of interaction. Journal of the ACM 39(4), 800–828 (1992)
5. Freivalds, R.: Amount of nonconstructivity in deterministic finite automata. Theoretical Computer Science 411(38-39), 3436–3443 (2010)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献