An NP-complete language accepted in linear time by a one-tape Turing machine
Theoretical Computer Science
Theoretical Computer Science - Special issue on logic and applications to computer science
An optimal lower bound for nonregular languages
Information Processing Letters
Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines
Journal of the ACM (JACM)
Computational Complexity of One-Tape Turing Machine Computations
Journal of the ACM (JACM)
Some Results on Tape-Bounded Turing Machines
Journal of the ACM (JACM)
Space complexity of alternating Turing machines
FCT '85 Fundamentals of Computation Theory
Java(TM) Language Specification, The (3rd Edition) (Java (Addison-Wesley))
Java(TM) Language Specification, The (3rd Edition) (Java (Addison-Wesley))
Context-free languages can be accepted with absolutely no space overhead
Information and Computation
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Complexity of nondeterministic multitape computations based on crossing sequences
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Hi-index | 0.00 |
In this paper we consider the time and the crossing sequence complexities of one-tape off-line Turing machines. We show that the running time of each nondeterministic machine accepting a nonregular language must grow at least as n log n, in the case all accepting computations are considered (accept measure). We also prove that the maximal length of the crossing sequences used in accepting computations must grow at least as log n. On the other hand, it is known that if the time is measured considering, for each accepted string, only the faster accepting computation (weak measure), then there exist nonregular languages accepted in linear time. We prove that under this measure, each accepting computation should exhibit a crossing sequence of length at least log log n. We also present efficient implementations of algorithms accepting some unary nonregular languages.