A recursive and a grammatical characterization of the exponential-time languages
- 31 October 1976
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 3 (1) , 61-74
- https://doi.org/10.1016/0304-3975(76)90065-7
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Subrecursiveness: Machine-independent notions of computability in restricted time and storageTheory of Computing Systems, 1972
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Writing pushdown acceptorsJournal of Computer and System Sciences, 1969
- Classes of predictably computable functionsTransactions of the American Mathematical Society, 1963