Introducing the theory of computation

MaRDI QIDQ3392285zbMATH OpenFDO

Authors Wayne Goddard

Publication date 13 August 2009

zbMATH Keywords

computational complexityautomataformal languagesgrammarscomputabilityTuring machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 1178947
• A concise introduction to languages and machines
• scientific article; zbMATH DE number 107969
• scientific article; zbMATH DE number 6164359
• Concise guide to computation theory.

Cited in

(11)

• scientific article; zbMATH DE number 107969 (Why is no real title available?)
• Discrete structures and automata theory
• An introduction to formal languages and automata.
• Introduction to the theory of formal languages
• scientific article; zbMATH DE number 702378 (Why is no real title available?)
• Theory of computation
• What can be computed? A practical guide to the theory of computation
• Theory of computation.
• Introduction to algorithm theory
• Logic and language models for computer science
• A concise introduction to languages and machines

This page was built for publication: Introducing the theory of computation

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