Concise Guide to Computation Theory
From MaRDI portal
Publication:5391637
DOI10.1007/978-0-85729-535-4zbMath1321.68001OpenAlexW4205638711MaRDI QIDQ5391637
Publication date: 7 April 2011
Full work available at URL: https://doi.org/10.1007/978-0-85729-535-4
NP-completenesscontext-free languageregular languagefinite automatonTuring machinepolynomial timecontext-free grammarBoolean circuitregular expressionpushdown automatonNPP
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of computing (68Qxx)
Related Items (1)
This page was built for publication: Concise Guide to Computation Theory