Journal of the ACM (JACM)
A Note Concerning Nondeterministic Tape Complexities
Journal of the ACM (JACM)
On the Covering and Reduction Problems for Context-Free Grammars
Journal of the ACM (JACM)
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
On the complexity of grammar and related problems
STOC '75 Proceedings of seventh 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
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
On the time and tape complexity of languages I
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Formal languages and their relation to automata
Formal languages and their relation to automata
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Reversal-bounded multi-pushdown machines
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Refinements of the nondeterministic time and space hierarchies
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Simple deterministic languages
SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
On the star height of regular events
FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
Information science: The loop complexity of regular events
Information Sciences: an International Journal
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Structural equivalence of context-free grammars
Journal of Computer and System Sciences
Algebraic Rewritings for Optimizing Regular Path Queries
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Implementing Reversed Alternating Finite Automaton (r-AFA) Operations
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Extended Context-Free Grammars and Normal Form Algorithms
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Minimal Covers of Formal Languages
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Bounded regular path queries in view-based data integration
Information Processing Letters
On the computational complexity of bisimulation, redux
Information and Computation
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Regular languages with variables on graphs
Information and Computation
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Hi-index | 0.00 |
We consider the complexity of the equivalence and containment problems for regular expressions and context-free grammars, concentrating on the relationship between complexity and various language properties. Finiteness and boundedness of languages are shown to play important roles in the complexity of these problems. An encoding into grammars of Turing machine computations exponential in the size of the grammar is used to prove several exponential lower bounds. These lower bounds include exponential time for testing equivalence of grammars generating finite sets, and exponential space for testing equivalence of non-self-embedding grammars. Several problems which might be complex because of this encoding are shown to simplify for linear grammars. Other problems considered include grammatical covering and structural equivalence for right-linear, linear, and arbitrary grammars.