Abstract
Yamamoto and Noguchi [YN87] raised the question of whether every recursively enumberable set can be accepted by a 1-tape or off-line 1-tape alternating Turing machine (ATM) whose (work)tape head makes only a constant number of reversals. In this paper, we answer the open question in the negative. We show that (1) constant-reversal 1-tape ATM's accept only regular languages and (2) there exists a recursive function h(k,r,n) such that for every k-state off-line 1-tape ATM M running in r reversals, the language accepted by M is in ASPACE(h(k,r,n)).
This research was supported in part by a grant from SERB, McMaster University and NSERC Operating Grant OGP 0046613.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Baker, B. and R. Book, Reversal-bounded multipushdown machines, J. of Comput. System Sci. 8, 1974, pp. 315–332.
Chan, T., Reversal complexity of counter machines, the Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981, pp. 146–157.
Chandra, A., D. Kozen, and L. Stockmeyer, Alternation, J. ACM 28, 1981, pp. 114–133.
Chen, J. and C. Yap, Reversal complexity, Proc. of 2nd IEEE Annual Conference on Structure in Complexity Theory, 1987, pp. 14–19.
Fisher, P., The reduction of tape reversal for off-line one-tape Turing machines, J. of Comput. System Sci. 2, 1968, pp. 136–147.
Gurari, E. and O. Ibarra, The complexity of decision problems for finite-turn multicounter machines, J. of Comput. System Sci. 22, 1981, pp. 220–229.
Greibach, S., Visits, crosses and reversal for nondeterministic off-line machines, Information and Control 36, pp. 174–216.
Hartmanis, J., Tape-reversal bounded Turing machine computations, J. of Comput. System Sci. 2, 1968, pp. 117–135.
Hopcroft, J. and J. Ullman, Introduction to automata theory, languages, and computation, Addison-Wesley, 1979.
Hromkovic, J., Alternating multicounter machines with constant number of reversals, Information Processing Letters 21, 1985, pp. 7–9.
Hromkovic, J., Tradeoffs for language recognition on alternating machines, Theoretical Computer Science 63, 1989, pp. 203–221.
Ibarra, O., Reversal-bounded multicounter machines and their decision problems, J. ACM 25, 1978, pp. 116–133.
Ibarra, O. and T. Jiang, The power of alternating one-reversal counters and stacks, to appear in SIAM J. on Computing; also Proc. of 3rd IEEE Annual Conference on Structure in Complexity, 1988, pp. 70–77.
Kameda, T. and R. Vollmar, Note on tape reversal complexity of languages, Information and Control 17, 1970, pp. 203–215.
Yamamoto, H. and S. Noguchi, Comparison of the power between reversal-bounded ATMs and reversal-bounded NTMs, Information and Computation 75, 1987, pp. 144–161.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, T. (1991). On the complexity of (off-line) 1-tape ATM's running in constant reversals. In: Akl, S.G., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '90. ICCI 1990. Lecture Notes in Computer Science, vol 468. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53504-7_65
Download citation
DOI: https://doi.org/10.1007/3-540-53504-7_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53504-1
Online ISBN: 978-3-540-46677-2
eBook Packages: Springer Book Archive