Capturing complexity classes by fragments of second-order logic
Theoretical Computer Science - Special issue on logic and applications to computer science
Linear Time Algorithms and NP-Complete Problems
SIAM Journal on Computing
The quantifier structure of sentences that characterize nondeterministic time complexity
Computational Complexity
Invariance properties of RAMs and linear time
Computational Complexity
Two tapes versus one for off-line Turing machines
Computational Complexity
Context-free languages and pushdown automata
Handbook of formal languages, vol. 1
Logics For Context-Free Languages
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Padding and the Expressive Power of Existential Second-Order Logics
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
On determinism versus non-determinism and related problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
On determinism versus non-determinism and related problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Note: a descriptive complexity approach to the linear hierarchy
Theoretical Computer Science
Fragments of Monadic Second-Order Logics Over Word Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of strings is in this class if and only if there is a formula of the form ∃f1..∃fk∃R1..∃Rm∀xφv; that is true exactly for all strings in L. In this formula the fi are unary function symbols, the Ri are unary relation symbols and φv; is a quantifierfree formula. Furthermore, the quantification of functions is restricted to non-crossing, decreasing functions and in φv; no equations in which different functions occur are allowed. There are a number of variations of this statement, e.g., it holds also for k = 3. From these results we derive an Ehrenfeucht game characterisation of NTIME(n).