Theory of Computation
DOI10.1002/9781118315361zbMath1252.68010OpenAlexW2476149286MaRDI QIDQ5390085
Publication date: 27 April 2012
Full work available at URL: https://doi.org/10.1002/9781118315361
computational complexityTuring machinesautomatadecidabilityformal languagescomputabilitygrammarsrecursive functionsloop programsunrestricted register machines
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Theory of programming languages (68N15) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20)
Related Items (2)
This page was built for publication: Theory of Computation