A recursive and a grammatical characterization of the exponential-time languages
From MaRDI portal
Publication:1237361
DOI10.1016/0304-3975(76)90065-7zbMath0355.68056MaRDI QIDQ1237361
Publication date: 1977
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-4330
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
03D20: Recursive functions and relations, subrecursive hierarchies
Related Items
Some observations on the connection between counting and recursion, Machine-independent description of certain machine complexity classes, Some formal results about stratificational grammars and their relevance to linguistics
Cites Work