B. Monien, Transformational Methods and Their Application to Complexity Problems, Acta Informatica, 6 (1976), 383--384. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Aspekty Komunikacyjne Oblicze N Systemw Automatw Sko Nczonych - Jurdzinski (1999) (Correct)
....jw i 2 f0;1g for 1 i 2m;w i = w 2m Gammai 1 for 1 i mg: They showed that L ( k 2 ) 2 1 DH(k) n 1 NH(k Gamma 1) First result of this kind for two way automata was obtained by Ibarra [12] It says that systems consisting of k 2 automata are more powerful than that of k automata. Monien [24] proved finally a tight hierarchy result for systems of two way automata (saying that k 1 automata are more powerful than k) also over unary languages [25] His result holds for both deterministic and non deterministic case. However, all these results were obtained by translational methods, no ....
B. Monien, Transformational Methods and Their Application to Complexity Problems, Acta Informatica, 6 (1976), 383--384.
Properties of Multihead Two-Way Probabilistic Finite Automata - Macarie (1994) (Correct)
.... twoway and one way finite automata, connections between multihead two way finite automata and the corresponding log space Turing machines, and transformations of languages recognized by one type of devices to languages recognized by the same or different types of devices [Ha72] Ib73] Su75] [Mo76], Se77a] Se77b] YR78] Mo80] More specifically, it was proven that the log space deterministic and nondeterministic complexity classes L and NL can be represented as proper hierarchies defined by deterministic and respectively nondeterministic multihead two way finite automata (i.e. L = ....
.... and nondeterministic automata are well known [Ha72] Next, we prove that the heads hierarchies are proper for multihead two way unbounded error and one sided error probabilistic automata (Theorems 3 5) The parallel relations for deterministic and nondeterministic automata were proved by Monien [Mo76] [Mo80] The first of these results, Theorem 1, is an immediate consequence of the following two lemmas. Lemma 1 S 1 k=1 kPFA cons = PL cons . Proof. The proof is an adaptation from the deterministic (nondeterministic) case [Ha72] ae) Straightforwardly, by storing the heads positions ....
[Article contains additional citation context not shown here]
Monien, B. Transformational Methods and their Application to Complexity Problems. Acta Informatica 6, 1976, pp. 95-108.
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