The Equivalence Problem of Simple Programs
Journal of the ACM (JACM)
Even simple programs are hard to analyze
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Program schemas with concurrency: execution time and hangups
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
A Decidability Result for Sequential Grammars
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
On the complexity of grammar and related problems
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
A complexity theory of grammar problems
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Generalized bottom-up parsing.
Generalized bottom-up parsing.
On parsing context free languages in parallel environments.
On parsing context free languages in parallel environments.
Formal languages and their relation to automata
Formal languages and their relation to automata
Lower Bounds and Reductions Between Grammar Problems
Journal of the ACM (JACM)
On the Decidability of Grammar Problems
Journal of the ACM (JACM)
The subgraph homeomorphism problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We present several techniques for proving lower bounds that can be applied to problems about grammars, formal languages, program schemes, simple programming languages, and automata. These techniques include dichotomization, extensions of dichotomization to certain classes of relational problems, recursive analogues of the Post Correspondence Problem, and the reachability problem. These techniques provide many new lower bounds and provide a unified framework for viewing much of the work on the complexity of problems about grammars, languages, schemes, and automata. We show how to prove the undecidability of a problem by efficiently reducing the membership problem for Tms that always halt to it. We also introduce the forbidden subgraph problem.