Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleMay 1975
Node listings for reducible flow graphs
STOC '75: Proceedings of the seventh annual ACM symposium on Theory of computingMay 1975, Pages 177–185https://doi.org/10.1145/800116.803767In [1], Kennedy conjectures that for every n node reducible flow graph, there is a sequence of nodes (with repetitions) of length O(nlogn) such that all acyclic paths are subsequences thereof. Such a sequence would, if it could be found easily, enable ...
- ArticleMay 1975
On the complexity of grammar and related problems
STOC '75: Proceedings of the seventh annual ACM symposium on Theory of computingMay 1975, Pages 54–65https://doi.org/10.1145/800116.803753In [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 ...