DeepAI AI Chat
Log In Sign Up

Resolution of the Linear-Bounded Automata Question

by   Tianrong Lin, et al.

This work resolve a longstanding open question in automata theory, i.e. the linear-bounded automata question ( shortly, LBA question), which can also be phrased succinctly in the language of computational complexity theory as NSPACE[n]?=DSPACE[n]. We prove that NSPACE[n]≠ DSPACE[n]. Our proof technique is based on diagonalization against all deterministic Turing machines working in O(n) space by an universal nondeterministic Turing machine running in O(n) space. Our proof also implies the following consequences: (1) There exists no deterministic Turing machine working in O(log n) space deciding the st-connectivity question (STCON); (2) L≠ NL; (3) L≠ P.


page 1

page 2

page 3

page 4


Diagonalization of Polynomial-Time Turing Machines Via Nondeterministic Turing Machine

The diagonalization technique was invented by Georg Cantor to show that ...

Refuting Tianrong Lin's arXiv:2110.05942 "Resolution of The Linear-Bounded Automata Question”

In the preprint mentioned in the title Mr. Tianrong claims to prove NSPA...

Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems

We consider general computational models: one-way and two-way finite aut...

Decision Theory with Resource-Bounded Agents

There have been two major lines of research aimed at capturing resource-...

From Functional Nondeterministic Transducers to Deterministic Two-Tape Automata

The question whether P = NP revolves around the discrepancy between acti...

Effective guessing has unlikely consequences

A classic result of Paul, Pippenger, Szemerédi and Trotter states that D...