Complexity of nondeterministic multitape computations based on crossing sequences

Authors:
Jiří Wiedermann
Affiliations:
Institute of Computer Science, Academy of Sciences of the Czech Republic, Czech Republic
Venue:
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Year:
2011

Citing 9
Cited 0

Fast simulations of time-bounded one-tape Turing machines by space-bounded ones

SIAM Journal on Computing
Computational Complexity of One-Tape Turing Machine Computations

Journal of the ACM (JACM)
On Time Versus Space

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Speeding-Up Nondeterministic Single-Tape Off-Line Computations by One Alternation

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Speeding-up Single-Tape Nondeterministic Computations by Single Alternation, with Separation Results

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Nondeterministic one-tape off-line turing machines and their time complexity

Journal of Automata, Languages and Combinatorics
Time- and tape-bounded turing acceptors and AFLs

Journal of Computer and System Sciences
Tape bounds for time-bounded turing machines

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Developing the concept of crossing sequences for multitape computations proposed in 1979 by G. Wechsung, we derive new relations among complexity measures for nondeterministic multitape computations. Especially, we characterize inherent relations between nondeterministic time and space and other complexity measures related to the notion of crossing sequences. We also show a nondeterministic simulation of nondeterministic computations whose complexity depends on the length of crossing sequences of the simulated machine. To a certain extent our results mirror classical results known to hold for single-tape computations or for deterministic multitape computations.