The complexity of ranking simple languages
- 1 December 1990
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 23 (1) , 1-19
- https://doi.org/10.1007/bf02090763
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- On pebble automataTheoretical Computer Science, 1986
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- On uniform circuit complexityJournal of Computer and System Sciences, 1981
- AlternationJournal of the ACM, 1981
- Tree-size bounded alternationJournal of Computer and System Sciences, 1980
- Path Systems: Constructions, Solutions and ApplicationsSIAM Journal on Computing, 1980
- The complexity of computing the permanentTheoretical Computer Science, 1979
- k + 1 Heads Are Better than kJournal of the ACM, 1978
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Finite-Turn Pushdown AutomataSIAM Journal on Control, 1966