Skip to main content
SpringerLink
Log in

Communication for alternating machines

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

A new model of parallel computations generalizing the concept of alternation is introduced and several properties of this model are established. The model supports a simple form of communication via states among parallel processes. It seems to be a useful tool for investigation of both nondeterminism and parallelism.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • AHU74 Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Reading, MA: Addison-Wesley 1974

    Google Scholar 

  • CKS81 Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM28, 114–133 (1981)

    Google Scholar 

  • Gin75 Ginsburg, S.: Algebraic and automata-theoretic properties of formal languages. North Holland, Amsterdam: North Holland 1975

    Google Scholar 

  • HU69 Hopcroft, J.E., Ullman, J.D.: Formal languages and their relation to automata. Reading, MA: Addison-Wesley 1969

    Google Scholar 

  • Hr85 Hromkovič, J.: On the power of alternation in automata theory. J. Comput. Syst. Sci.31, 28–39 (1985)

    Google Scholar 

  • Hr86a Hromkovič, J.: How to organize the communication among parallel processes in alternating computations. (Unpublished manuscript, January 1986)

  • Hr86b Hromkovič, J.: Tradeoffs for language recognition on alternating machines. Theor. Comput. Sci.63, 203–221 (1989)

    Google Scholar 

  • HIRSTW Hromkovič J., Inoue K., Rovan B., Slobodová A., Takanami I., Wagner K.: On the power of one-way synchronized alternating machines with small space. Int. J. Foundat. Comput. Sci. (to appear)

  • HKRS Hromkovič J., Karhumäki J., Rovan B., Slobodová A.: On the power of synchronization in parallel computations. Discrete Appl. Math.32, 155–182 (1991)

    Google Scholar 

  • IT91 Ibarra O.H., Tran N.Q.: On space-bounded synchronized alternating Turing machines. Proc. 8th FCT '91 (Lect. Notes Comput. Sci., Vol. 529, pp. 248–257) Berlin Heidelberg New York: Springer 1991

    Google Scholar 

  • IT92 Ibarra O.H., Tran N.Q.: New results concerning synchronized finite automata (accepted for ICALP '92)

  • Kin81 King, K.N.: Alternating multihead finite automata. Proc. 8th ICALP'81. (Lect. Notes Comput. Sci., Vol. 115, pp. 506–520) Berlin Heidelberg New York: Springer 1981

    Google Scholar 

  • LLS84 Ladner, R.J., Lipton, R.J., Stockmeyer, L.J.: Alternating pushdown and stack automata. SIAM J. Comput.13, 135–155 (1984)

    Google Scholar 

  • Min61 Minsky, M.L.: Recursive unsolvability of Post's problem of “Tag” and other topics in the theory of Turing machines. Ann. Math.74, 437–455 (1961)

    Google Scholar 

  • PPR80 Paul, W.J., Prauss, E.J., Reischuk, R.: On alternation. Acta Inf.14, 243–255 (1980)

    Google Scholar 

  • Slo87 Slobodová, A.: On the power of communication in alternating computations. Student Research Paper Competition, Section Computer Science, Comenius University, Bratislava, April 1987 (in Slovak)

    Google Scholar 

  • Slo88 Slobodová, A.: On the power of communication in alternating machines. MFCS'88 (Lect. Notes Comput. Sci., Vol. 324, pp. 518–528). Berlin Heidelberg New York: Springer 1988

    Google Scholar 

  • Slo92 Slobodová, A.: Some properties of space-bounded synchronized alternating Turing machines with universal states only. Theor. Comput. Sci.96, 411–419 (1992)

    Google Scholar 

  • Slo90 Slobodová, A.: One-way globally deterministic synchronized alternating finite automata recognize exactly deterministic context-sensitive languages. Inf. Process. Lett.36, 69–72 (1990)

    Google Scholar 

  • Sud75 Sudborough, I.H.: On tape-bounded complexity classes. J. Comput. System Sci.10, 62–76 (1975)

    Google Scholar 

  • VEB88 van Emde Boas, P.: The second machine class 2, an encyclopedic view on the Parallel computation thesis. In: Rasiowa, H. (ed.) Mathematical problems in computational theory. (Banach Center Publications, Vol. 21, pp. 235–256). Warsaw: PWN-Polish Scientific Publishers 1988

    Google Scholar 

  • WW86 Wagner, K., Wechsung, G.: Computational complexity. (Mathematische Monographien 19) Berlin: Deutscher Verlag der Wissenschaften 1986

    Google Scholar 

  • Wie89 Wiedermann J.: On the power of synchronization. J. Inf. Process. Cybern. Elk25 (10), 499–506 (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Comenius University, CS-842 15, Bratislava, Czechoslovakia

    Anna Slobodová

Authors
  1. Anna Slobodová
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

A preliminary version of this paper was presented on MFCS'88 (see [Slo 88])

Rights and permissions

Reprints and permissions

About this article

Cite this article

Slobodová, A. Communication for alternating machines. Acta Informatica 29, 425–441 (1992). https://doi.org/10.1007/BF01193576

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01193576

Keywords

Search

Navigation