A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
On space-bounded synchronized alternating Turing machines
1992
Theoretical Computer Science
Preserved Fulltext
synchronized)
alternating
Turing machines with universal states only and [one-way]
(plain, with modified
acceptance. synchronkcdl
alternating
Turing machines space-bounded
by function
S(r7), ...
In [24] some properties of space-bounded synchronized alternating Turing machines with only universal states were established. ...
Note that if U( lS.4 TM (log(n))) = Y'( 1 A TM (log(n))) then alternating Turing machines use space optimally, and hence P= NP (see [S] ). ...
doi:10.1016/0304-3975(92)90351-f
fatcat:eu4yogf3wjcydc2dhugo2yau3q
Some properties of space-bounded synchronized alternating Turing machines with universal states only
1992
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A (synchronized) alternating Turing machine which has no existential states is denoted by (S)UTM and is called (synchronized) unioersally branching Turing machine. ...
A synchronized alternating Turing machine (SATM) is a Turing machine with the set of states partitioned into existential, universal, accepting and rejecting states. ...
doi:10.1016/0304-3975(92)90346-h
fatcat:b2csv34h5rhtbbedkt4t5ljoy4
Page 2853 of Mathematical Reviews Vol. , Issue 87f
[page]
1987
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The number 6 comes from the result that a
linear-space-bounded symmetric Turing machine can be simulated
by an exponential-space-bounded symmetric “counter” machine
with only three counters (Lemma 3.4) ...
as a Turing machine (one-way blind multicounter machines); (3) he shows that bounding the number of A-moves by a function o((n/logn)'/?) ...
Page 422 of Mathematical Reviews Vol. , Issue 91A
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “A new model of parallel computations, the so-called synchronized Turing machines, is presented. They generalize stan- dard alternating Turing machines. ...
Thus, synchronized Turing ma- chines present the first known fundamental machine model which can be proved to be more efficient than deterministic or nondeter- ministic Turing machines, and for which space ...
Page 3555 of Mathematical Reviews Vol. , Issue 2002E
[page]
2002
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Also it is known that all alternation hierarchies for strongly L(n) space bounded Turing machines collapse [A. Szepietowski, Turing ma- chines with sublogarithmic space, Lecture Notes in Comput. ...
It is known that the alternation hierarchy for Turing machines with space bounds between loglogn and logn is infinite [B. von Braunmihl, R. Gengler and R. Rettinger, Com- put. ...
ON THE POWER OF ONE-WAY GLOBALLY DETERMINISTIC SYNCHRONIZED ALTERNATING TURING MACHINES AND MULTIHEAD AUTOMATA
1995
International Journal of Foundations of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
It is known that in the case of space{bounded Turing machine and multihead automata, the one-way SA models are equivalent to their two-way counterparts. We show that the same holds for GDSA models. ...
the space complexity classes de ned by nondeterministic Turing machines. ...
The natural question that arises by comparing I. and II. is how powerful the one-way GDSA space{bounded Turing machines and multihead automata are. ...
doi:10.1142/s0129054195000238
fatcat:qtaf54m33rfctii5wm4u5ww3ki
Cumulative subject index volumes 64–67
1985
Information and Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Turing
machines, 67, 2
M
Machines
Turing, see Turing machines
Metric spaces
and Scott domains and synchronization
trees, relationships, 66, 6
Models
2-calculus, powerposet expansion to, 66, ...
: algorithm construc-
tion and applications, 64, 52
Turing machines
alternating, with restrictions on looping,
67, 2
space-and time-efficient simulations:
restricted
classes of pushdown
automata ...
doi:10.1016/s0019-9958(85)80038-3
fatcat:cnfpoerj4bgahkwbjf5nrkty5e
Page 7832 of Mathematical Reviews Vol. , Issue 2003j
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The second result states that five-way synchronized alternating Turing machines without exis- tential states can recognize Tc on space m’, and that this bound is optimal. ...
Turing machines. ...
Page 3931 of Mathematical Reviews Vol. , Issue 93g
[page]
1993
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
A variant of alternating Turing machines (ATM) is introduced. ...
However, the situation is different when we consider alternating machines with no existential states (so-called universal machines—UTM and MUTM, respectively), and with sublinear space bounds. ...
Deterministic versus nondeterministic space in terms of synchronized alternating machines
1994
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
., Deterministic versus nondeterministic space in terms of synchronized alternating machines, Theoretical Computer Science 132 (1994) 3199336. ...
Each process Dfj is an S(n)-space bounded multitape Turing machine that (a) has the input head on the ith position of the input tape, (b) stores the number j~(0, 1, .., , cS("-1) on its working tape, ( ...
The space complexity SA(n) of a synchronized alternating multitape Turing machine A on inputs of length n is the maximum number of tape cells visited by the storage head in all accepting computations of ...
doi:10.1016/0304-3975(94)90238-0
fatcat:lic4dnrljbge3l2akwyo6no7ti
Complexity of EOL structural equivalence
[chapter]
1994
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Here employing synchronized alternating Turing machines we obtain a (single) exponential space upper bound for EOL structural équivalence. ...
synchronized alternating Turing machines, SATM's. ...
doi:10.1007/3-540-58338-6_105
fatcat:dmgvqskxynao7hpoomzkjngvhm
Complexity of E0L structural equivalence
1995
RAIRO - Theoretical Informatics and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Here employing synchronized alternating Turing machines we obtain a (single) exponential space upper bound for EOL structural équivalence. ...
synchronized alternating Turing machines, SATM's. ...
doi:10.1051/ita/1995290604711
fatcat:srktc66sznel7k73r674kxevhy
A communication hierarchy of parallel computations
1998
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The situation changes very dramatically for space bounds. The communication hierarchy of space bounded CA,.-machines is infinite, since, for each r >, 0, CA,+2 ...
Simultaneous restriction on both time and space gives CAPTIME -LOGSPACE = PSPACE. ...
The function t(n) is time constructible in s(n) space, if, moreover, the above Turing machine is O(s(n)) space bounded. ...
doi:10.1016/s0304-3975(97)00033-9
fatcat:egjrwtykt5dhxggrsgqu3ctgna
Page 2148 of Mathematical Reviews Vol. , Issue 86e
[page]
1986
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
work tape, are characterized in terms of complexity classes defined by time-bounded deterministic Turing machines. ...
Author summary: “We present some space/time efficient Turing machine algorithms for recognizing some subclasses of DCF Ls. ...
Page 7059 of Mathematical Reviews Vol. , Issue 2003i
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “This paper investigates non-closure properties of the classes of sets accepted by space-bounded two-dimensional alternating Turing machines and three-way two-dimensional alternating Turing machines ...
two-dimensional alternating
Turing machines. ...
« Previous
Showing results 1 — 15 out of 6,633 results