Elements of computation theory
DOI10.1007/978-1-84882-497-3zbMATH Open1182.68087OpenAlexW1626360986MaRDI QIDQ1010960FDOQ1010960
Authors: Arindama Singh
Publication date: 7 April 2009
Published in: Texts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-84882-497-3
Recommendations
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) General topics in the theory of computing (68Q01)
Cited In (15)
- Theory of computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mathematics in Computing
- Languages, machines, and classical computation
- Title not available (Why is that?)
- Can a free market be complete?
- Concise guide to computation theory.
- Computability and complexity theory.
- The pillars of computation theory. State, encoding, nondeterminism
- Title not available (Why is that?)
- The nature of computation
- What can be computed? A practical guide to the theory of computation
- Formal languages and computation. Models and their applications
This page was built for publication: Elements of computation theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010960)