This is a preview of subscription content, log in via an institution to check access.
Literature Cited
J. Hartmanis, Feasible Computations and Provable Complexity Properties, Soc. Industr. Appl. Math., Philadelphia (1978).
A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer, “Alternation,” J. ACM,28, No. 1, 114–133 (1981).
M. O. Rabin and D. Scott, “Finite automata and decision problems,” Kibern., Sb., No. 4, 58–91 (1962).
A. L. Rosenberg, “On multi-head finite automata,” IBM J. Res. Develop.,10, No. 5, 388–394 (1966).
A. V. Gladkii, Formal Grammars and Languages [in Russian], Nauka, Moscow (1973).
S. O. Aanderaa, “On k-tape versus (k-1)-tape real time computations,” SIAM-AMS Proc.,8, 75–96 (1974).
R. V. Freivald, “Acceptance of languages by finite probabilistic multitape and multihead automata,” Probl. Peredachi Inform.,15, No. 3, 99–106 (1979).
A. L. Rosenberg, “On n-tape finite-state acceptors,” Proc. 5th Ann. Symp. Switching. Circuit Theory and Logical Design, Princeton (1964), pp. 76–81.
A. C. Yao and R. L. Rivest, “k+1 heads are better than k,” Proc. 17th Symp. on Foundations of Computer Science, New York (1976), pp. 67–70.
Additional information
Translated from Kibernetika, No. 6, pp. 26–30, November–December, 1986.
Rights and permissions
About this article
Cite this article
Alberts, M.Y. Possibilities of various types of alternating automata. Cybern Syst Anal 22, 714–720 (1986). https://doi.org/10.1007/BF01068687
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068687