This paper deals with parallel Turing machines with multi-head control units on one or more tapes which can be considered as a generalization of cellular automata. We discuss the problem of finding an appropriate measure of space complexity. A definition is suggested which implies that the model is in the first machine class. It is shown that without loss of generality it suffices to consider only parallel Turing machines of certain normal forms
AbstractThe alternating machine having a separate input tape with k two-way, read-only heads, and a ...
A new device called a maze recognizing automaton is introduced. The following two statements are sho...
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, ...
Parallel Turing machines (PTM) can be viewed as a generalization of cellular automata (CA) whe...
AbstractParallel Turing machines (Ptm) can be viewed as a generalization of cellular automata (Ca) w...
Several classes of multihead and auxiliary stack automata are introduced and are used to characteriz...
It is shown that for any real constants b>a≥0, multitape Turing machines operating in space L1(n)=[b...
AbstractThe main result of this paper is that, given a Turing machineMwithk-heads on ad-dimensional ...
A model of parallel computation based on a generalization of nondeterminism in Turing machines is i...
We prove that arbitrary single-tape Turing machines can be simulated by uniform families of P system...
AbstractFor d and k > 2, d-dimensional k-tape Turing machines cannot simulate d-dimensional Turing m...
AbstractThis paper studies the classification of recursive sets by the number of tape reversals requ...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, ...
AbstractDeterministic k-tape and multitape Turing machines with one-way, two-way and without a separ...
AbstractThe alternating machine having a separate input tape with k two-way, read-only heads, and a ...
A new device called a maze recognizing automaton is introduced. The following two statements are sho...
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, ...
Parallel Turing machines (PTM) can be viewed as a generalization of cellular automata (CA) whe...
AbstractParallel Turing machines (Ptm) can be viewed as a generalization of cellular automata (Ca) w...
Several classes of multihead and auxiliary stack automata are introduced and are used to characteriz...
It is shown that for any real constants b>a≥0, multitape Turing machines operating in space L1(n)=[b...
AbstractThe main result of this paper is that, given a Turing machineMwithk-heads on ad-dimensional ...
A model of parallel computation based on a generalization of nondeterminism in Turing machines is i...
We prove that arbitrary single-tape Turing machines can be simulated by uniform families of P system...
AbstractFor d and k > 2, d-dimensional k-tape Turing machines cannot simulate d-dimensional Turing m...
AbstractThis paper studies the classification of recursive sets by the number of tape reversals requ...
Let L be a language recognized by a nondeterministic (single-tape) Turing machine of time complexity...
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, ...
AbstractDeterministic k-tape and multitape Turing machines with one-way, two-way and without a separ...
AbstractThe alternating machine having a separate input tape with k two-way, read-only heads, and a ...
A new device called a maze recognizing automaton is introduced. The following two statements are sho...
We survey some work concerned with small universal Turing machines, cellular automata, tag systems, ...