On Decompositions of Regular Events
Journal of the ACM (JACM)
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Tree-oriented proofs of some theorems on context-free and indexed languages
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
On the Time and Tape Complexity of Languages, I
On the Time and Tape Complexity of Languages, I
Formal languages and their relation to automata
Formal languages and their relation to automata
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Computational parallels between the regular and context-free languages
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Detecting palindromes, patterns and borders in regular languages
Information and Computation
A note on the space complexity of some decision problems for finite automata
Information Processing Letters
Polynomial and abstract subrecursive classes
Journal of Computer and System Sciences
On the equivalence, containment, and covering problems for the regular and context-free languages
Journal of Computer and System Sciences
Space-bounded reducibility among combinatorial problems
Journal of Computer and System Sciences
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Formal language constrained reachability and model checking propositional dynamic logics
RP'11 Proceedings of the 5th international conference on Reachability problems
| Hi-index | 0.00 |
We investigate the following: (1) the relationship between the classes of languages accepted by deterministic and nondeterministic polynomial time bounded Turing machines; (2) the time and tape complexity of many predicates on the regular sets; (3) the relationship between the classes of languages accepted by deterministic or nondeterministic polynomial time bounded Turing machines and the class of languages accepted by polynomial tape bounded Turing machines; and (4) the complexity of many predicates about stack automata. We find several problems with nonpolynomial lower complexity bounds.