### Citations

85 |
Characterizations of pushdownmachines in terms of time-bounded computers
- Cook
- 1971
(Show Context)
Citation Context ...1)-NFA that coincides with the class Aux2DC of languages recognized by deterministic 2-way counter automata with a logarithmic auxiliary memory. The inclusion Aux2DC ⊂ P follows from the Cook theorem =-=[5]-=-. The Cook theorem claims that Aux2PDA = AuxN2PDA = P, where Aux2PDA is the class of languages recognized by deterministic 2-way pushdown automata with a logarithmic auxiliary memory and AuxN2PDA is t... |

82 |
Theory of Formal Systems
- Smullyan
- 1961
(Show Context)
Citation Context ... s it is sufficient to deal with configurations of length 2s. Each step of computation changes the configuration of the machine. We will describe this change using arithmetic encoding of binary words =-=[11, 12]-=-. Namely, a word w ∈ {0, 1} ∗ is encoded by a positive integer c(w) written in binary as 1w. We will encode a configuration ℓqar by a 4-tuple (c(ℓ), q, a, c(r R )), where r R denote the word r is the ... |

33 |
Algorithmic Number Theory, Vol. I: Efficient Algorithms
- Bach, Shallit
- 1996
(Show Context)
Citation Context ...where n is the input length. Thus, the relations (1) can be verified by calculations modulo 1, 2, . . ., m = poly(n). This fact follows from the Chinese remainder theorem and the prime number theorem =-=[2]-=-. Now we are ready to describe a W1.5-automaton verifying a computational history on the input word u using a space s. The automaton expects a guess in form u(ℓ0)q0a0u(r0)#u(ℓ1)q1a1u(r1)# . . . #u(ℓt)... |

5 |
J.D.: “Introduction to automata and language theory
- Hopcroft, Ullman
- 1979
(Show Context)
Citation Context ...ed manuscript. 1The most natural variant of the auxiliary memory is a 2-way tape. The corresponding computational model appears to be very close to nonerasing nondeterministic stack automata (NENSA) =-=[8, 10]-=-. Similarly to multi-head NENSA, the automata with 2-way read only guess tape recognize all languages from the class PSPACE. It is possible to define in our settings a deterministic computation as a s... |

2 |
Alternating and empty alternating auxiliary stack automata. Theoretical computer science
- Holzer, McKenzie
- 2003
(Show Context)
Citation Context ... synchronized alternating 2-way automata [4, 6, 9]. There are also characterizations of NP, the polynomial hierarchy and some other complexity classes in terms of alternating auxiliary stack automata =-=[7]-=-. Our results differ from these characterization because the models considered in this paper do not use alternation. It is worth to mention a paper [3], which contains the characterizations of P, NP a... |

1 |
and Kazuo Iwama. Undecidability on Quantum Finite Automata. STOC’99
- Amano
- 1999
(Show Context)
Citation Context ... automata (NEDSA) and also recognize the languages from the class PSPACE. We focus our attention on a more restricted memory model, so-called 1.5-way tape. It was used in research of quantum automata =-=[1]-=-. For classic automata 1.5-way tape means an 1-way tape with an additional possibility to return into the first cell. The nondeterministic automata with 1.5-way tape also recognize the class PSPACE (T... |

1 |
Kozen D.C., Stockmeyer L.J. alternation
- Chandra
- 1981
(Show Context)
Citation Context ...asses in terms of some sort of automata. The classes L, NL, P, PSPACE have the well-known characterizations by deterministic, nondeterministic, alternating and synchronized alternating 2-way automata =-=[4, 6, 9]-=-. There are also characterizations of NP, the polynomial hierarchy and some other complexity classes in terms of alternating auxiliary stack automata [7]. Our results differ from these characterizatio... |

1 |
A communication hierarchy of parallel computations. Theoretical computer science
- Geffert
- 1998
(Show Context)
Citation Context ...asses in terms of some sort of automata. The classes L, NL, P, PSPACE have the well-known characterizations by deterministic, nondeterministic, alternating and synchronized alternating 2-way automata =-=[4, 6, 9]-=-. There are also characterizations of NP, the polynomial hierarchy and some other complexity classes in terms of alternating auxiliary stack automata [7]. Our results differ from these characterizatio... |

1 |
On the power of syncronization in parallel computations
- Hromkovič, Karhumäki, et al.
- 1991
(Show Context)
Citation Context ...asses in terms of some sort of automata. The classes L, NL, P, PSPACE have the well-known characterizations by deterministic, nondeterministic, alternating and synchronized alternating 2-way automata =-=[4, 6, 9]-=-. There are also characterizations of NP, the polynomial hierarchy and some other complexity classes in terms of alternating auxiliary stack automata [7]. Our results differ from these characterizatio... |

1 |
Characterizations of some tape and time complexity c;asses of Turing machines of multihead and auxiliary stack automata
- Ibarra
- 1971
(Show Context)
Citation Context ...). ∗ Dorodnitsyn Computing Center of RAS, Vavilova, 40, Moscow, 119991, Russia. The work is supported by the RFBR grants 08–01–00414, 05–01–02803–NTsNIL a and the grant NS 5294.2008.1. 1 O. H. Ibarra =-=[10]-=- attributed this result to A. Cobham and coauthors referring to an unpublished manuscript. 1The most natural variant of the auxiliary memory is a 2-way tape. The corresponding computational model app... |