Two-Tape Simulation of Multitape Turing Machines
Journal of the ACM (JACM)
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Gap theorems for distributed computing
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
On the bit complexity of distributed computations in a ring with a leader
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Church-Rosser Thue systems and formal languages
Journal of the ACM (JACM)
Computational Complexity and the Existence of Complexity Gaps
Journal of the ACM (JACM)
Deterministic Turing machines in the range between real-time and linear-time
Theoretical Computer Science
Quantum Real-Time Turing Machine
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Reversal complexity of counter machines
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Relations between diagonalization, proof systems, and complexity gaps
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
B70-5 Theories of Abstract Automata
IEEE Transactions on Computers
Theory of computing in computer science education
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Nondeterministic one-tape off-line turing machines and their time complexity
Journal of Automata, Languages and Combinatorics
Deterministic multitape automata computations
Journal of Computer and System Sciences
Tape-reversal bounded turing machine computations
Journal of Computer and System Sciences
Complexity of nondeterministic multitape computations based on crossing sequences
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Automatic functions, linear time and learning
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
| Hi-index | 0.03 |
The quantitative aspects of one-tape Turing machine computations are considered. It is shown, for instance, that there exists a sharp time bound which must be reached for the recognition of nonregular sets of sequences. It is shown that the computation time can be used to characterize the complexity of recursive sets of sequences, and several results are obtained about this classification. These results are then applied to the recognition speed of context-free languages and it is shown, among other things, that it is recursively undecidable how much time is required to recognize a nonregular context-free language on a one-tape Turing machine. Several unsolved problems are discussed.