A. Slobbodova. On the power of communication in alternating machines. In Proc. 13th International Symp. on Mathematical Foundations of Computer Science, volume 324 of Lecture Notes in Computer Science, pages 518--528, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Improved Algorithm for the Membership Problem for.. - Kupferman, Zuhovitzky (2002) (4 citations) (Correct)
.... equal to (r 1 r 3 ) r 2 r 3 ) In contrast, r 1 r 2 ) r 3 is equal to (r 1 r 3 ) r 2 r 3 ) which is why RE can be efficiently translated to alternating automata, while SERE cannot [KTV01] Several models of automata with synchronization are studied in the literature [Hro86, Slo88, DHK 89, Yam00b] Essentially, in synchronous alternating automata, some of the states are designated as synchronization states, and the spawned copies of the automaton have to agree on positions in the input word in which they visit synchronization states. In [Yam00a] Yamamoto introduces ....
A. Slobbodova. On the power of communication in alternating machines. In Proc. 13th International Symp. on Mathematical Foundations of Computer Science, volume 324 of Lecture Notes in Computer Science, pages 518--528, 1988.
Complexity: A Language-Theoretic Point of View - Calude, Hromkovic (1995) (Correct)
....SALOG and SAP denote synchronized alternating logspace and synchronized alternating polynomial time respectively. The main results proven in [90] are the following: Theorem 1.37 [90] For any space constructible function s : N # N, c 0 NSPACE(nc s(n) SASPACE(s(n) Corollary 1. 38 [90, 133] For any space constructible function s(n) # log 2 n SASPACE(s(n) c 0 DSPACE(c s(n) c 0 AT IME(c s(n) c 0 SATIME(c s(n) Corollary 1.39 [90, 133] NSPACE(n) is exactly the class of languages recognized by synchronized alternating finite automata. We observe ....
....[90] For any space constructible function s : N # N, c 0 NSPACE(nc s(n) SASPACE(s(n) Corollary 1.38 [90, 133] For any space constructible function s(n) # log 2 n SASPACE(s(n) c 0 DSPACE(c s(n) c 0 AT IME(c s(n) c 0 SATIME(c s(n) Corollary 1. 39 [90, 133] NSPACE(n) is exactly the class of languages recognized by synchronized alternating finite automata. We observe that the equality SASPACE(s(n) c 0 SATIME(c s(n) 38 CHAPTER 1. COMPLEXITY implies that synchronized alternating machines are able to use the space in an optimal way . It ....
A. Slobodova, On the power of communication in alternating machines. In: Proc. 13th MFCS'88, Lect. Notes in Comp.Sci. 324, Springer--Verlag 1988, 518--528.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC