Concise guide to computation theory.

DOI10.1007/978-0-85729-535-4MaRDI QIDQ5391637zbMATH OpenOpenAlexFDO

Authors A. Maruoka

Publication date 7 April 2011

Full work available at URL https://doi.org/10.1007/978-0-85729-535-4

zbMATH Keywords

Boolean circuitcontext-free grammarcontext-free languagefinite automatonNPNP-completenessPpolynomial timepushdown automatonregular expressionregular languageTuring machine

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of computing (68Qxx)

Recommendations

• Elements of computation theory
• scientific article; zbMATH DE number 107969
• scientific article; zbMATH DE number 6164359
• scientific article; zbMATH DE number 1178947
• scientific article; zbMATH DE number 805390

Cited in

(6)

• Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs
• Introducing the theory of computation
• scientific article; zbMATH DE number 1052322 (Why is no real title available?)
• What can be computed? A practical guide to the theory of computation
• Theory of computation
• Computability and complexity

This page was built for publication: Concise guide to computation theory.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5391637)