Journal of the ACM (JACM)
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
An Overview of the Theory of Computational Complexity
Journal of the ACM (JACM)
On the complexity of LR(k) testing
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
Degrees of translatability and canonical forms in program schemas: Part I
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Storage requirements for deterministic / polynomial time recognizable languages
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Complete problems for deterministic polynomial time
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Computational parallels between the regular and context-free languages
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
An observation on time-storage trade off
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Generalized bottom-up parsing.
Generalized bottom-up parsing.
On the time and tape complexity of languages.
On the time and tape complexity of languages.
Efficient algorithms for structural similarity of grammars
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dichotomization, reachability, and the forbidden subgraph problem(Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
On the equivalence, containment, and covering problems for the regular and context-free languages
Journal of Computer and System Sciences
| Hi-index | 0.00 |
In [1] and [2] a complexity theory for formal languages and automata was developed. This theory implies most of the previously known results and yields many new results as well. Here we develop an analogous theory for several classes of more practically motivated problems. Two such classes, both closely related to formal language and automata theory, suggest themselves - grammar problems and program scheme problems. Here, our primary emphasis is on grammar problems of interest in parsing and compiling. Other problems considered include - (1) possible techniques for proving non-trivial lower complexity bounds for problems in P; (2) the relationship of the complexity of tree automaton equivalence, structural equivalence, and grammatical covering; and (3) the complexity of the equivalence problem for schemes. In each case we relate the computational complexity of a problem to its underlying combinatorial structure. The remainder of the paper is divided into four sections.