Properties that characterize LOGCFL
- 1 October 1991
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 43 (2) , 380-404
- https://doi.org/10.1016/0022-0000(91)90020-6
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Two Applications of Inductive Counting for Complementation ProblemsSIAM Journal on Computing, 1989
- Membership for growing context-sensitive grammars is polynomialJournal of Computer and System Sciences, 1986
- The Complexity of Languages Generated by Attribute GrammarsSIAM Journal on Computing, 1986
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- Alternating Pushdown and Stack AutomataSIAM Journal on Computing, 1984
- Upper and lower bounds for first order expressibilityJournal of Computer and System Sciences, 1982
- AlternationJournal of the ACM, 1981
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977
- The monotone and planar circuit value problems are log space complete for PACM SIGACT News, 1977
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971