Seiferas, J. I. Relating Refined Space Complexity Classes, J. Comp. and System Sc. 14, 1977, pp. 100-129. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Properties of Multihead Two-Way Probabilistic Finite Automata - Macarie (1994) (Correct)
.... 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 = S 1 k=1 ....
....The first step of our proof (i.e. the coarse separations z kPFA cons c z PL and z kPFA cons z PL) is specific to probabilistic computation. For the corresponding step in the nondeterministic case, Monien [Mo80] uses a separation result due to Seiferas [Se77a] [Se77b] Note that based on the fact that NL is closed under complementation [Im88] Sz87] the coarse separation from Monien s proof can be significantly simplified. The second part of the proof (i.e. how to contradict the coarse separations from the assumptions kPFA cons = k 1)PFA cons ....
[Article contains additional citation context not shown here]
Seiferas, J. I. Relating Refined Space Complexity Classes, J. Comp. and System Sc. 14, 1977, pp. 100-129.
On the Structure of Log-Space Probabilistic Complexity Classes - Macarie (1994) (Correct)
.... from characterizations of hierarchies of multihead finite automata to their relation with logspace Turing machines and to transformations (reductions) of languages recognized by one type of device to languages recognized by the same (or different) type of device [Ha72] Ib73] Su75] Mo76] [Se77a], Se77b] Mo80] More specifically, it was shown that logspace deterministic and nondeterministic complexity classes (i.e. L and NL) can be represented as (proper) hierarchies defined by deterministic and respectively nondeterministic multihead two way finite automata (i.e. L = S 1 k=1 ....
....control and only two heads. Recall that, for every class of languages C, z C denotes the languages of type X contained in C. The first step of our proof (i.e. the coarse separation z 2PFA(k) z PL) is new. For this step, Monien uses a separation result due to Seiferas [Se77a] [Se77b] Note that using the fact that NL is closed under complement [Im88] Sz87] Monien s proof can be significantly simplified. The second part of the proof (i.e. how to contradict the coarse separation from the assumption z 2PFA(k) z 2PFA(k) for some k ) is an ....
[Article contains additional citation context not shown here]
Seiferas, J. I. Relating Refined Space Complexity Classes, J. Comp. and System Sc., Vol. 14, 1977, pp. 100-129.
Amplification of Slight Probabilistic Advantage at.. - Ioan I. Macarie.. (1998) Self-citation (Seiferas) (Correct)
....with the corresponding multihead finite automata rather than with logarithmic space bounded Turing machines. The latter are collectively equivalent to the former [Ha72] but doubling the space corresponds, roughly, to doubling the number of heads, a resource that definitely cannot be so reduced [Se77, Mo80]. We show below that Gill s result can be tightened, really to require no extra space, and to hold even at sublogarithmic levels, at least if the space bounds are suitably constructible. And the same argument shows that each nondeterministic multihead finite automaton can be simulated, with small, ....
J. I. Seiferas, Relating refined space complexity classes, Journal of Computer and System Sciences 14, 1 (February, 1977), 100--129.
Characterization of Realizable Space Complexities - Seiferas, Meyer (1994) (3 citations) Self-citation (Seiferas) (Correct)
....on the storage tape. If we fix the alphabet, we can still implement all the same algorithms by encoding the symbols of larger alphabets, with an increase in space usage reflecting the extra space needed to store larger symbols. In this setting, tighter compression does in fact become possible [Se77], and we adopt such a model below. Aside from the limitation on storage tape alphabet and an ability to recognize the end of the already used segment of the storage tape, our Turing machine model is a standard one. Namely, each machine consists of a finite state program with access to an input ....
J. I. Seiferas, Relating refined space complexity classes, Journal of Computer and System Sciences 14, 1 (February 1977), 100--129.
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