Tree-size bounded alternation
- 1 October 1980
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 21 (2), 218-235
- https://doi.org/10.1016/0022-0000(80)90036-7
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Path Systems: Constructions, Solutions and ApplicationsSIAM Journal on Computing, 1980
- Provably Difficult Combinatorial GamesSIAM Journal on Computing, 1979
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977
- The complexity of the membership problem for some extensions of context-free languagest†International Journal of Computer Mathematics, 1977
- A characterization of the power of vector machinesJournal of Computer and System Sciences, 1976
- A Note on Tape-Bounded Complexity Classes and Linear Context-Free languagesJournal of the ACM, 1975
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- On context-free languages and push-down automataInformation and Control, 1963