Theoretical informatics

MaRDI QIDQ5503904zbMATH OpenFDO

Authors Dirk W. Hoffmann

Publication date 21 January 2009

zbMATH Keywords

automatacomputabilitycomputational complexityformal languagesfoundations of theoretical computer sciencelogical deduction

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Formal languages and automata (68Q45)

Recommendations

• Theoretical informatics.
• Theoretical informatics. An extensive introduction
• scientific article; zbMATH DE number 1453448
• scientific article; zbMATH DE number 970828
• Computability and complexity theory

Cited in

(11)

• Theoretical informatics. A compact introduction
• Theoretical computer science. Introduction to automata, computability, complexity, algorithmics, randomization, communication, and cryptography.
• Theoretical informatics.
• The nature of computation
• Introduction to theoretical computer science. Formal languages and automata.
• Algorithmic information theory. Understanding computability and complexity
• Technical informatics. An introduction to computability, complexity and formal languges with 101 examples
• scientific article; zbMATH DE number 3965406 (Why is no real title available?)
• Automata and computability. A programmer's perspective
• scientific article; zbMATH DE number 970828 (Why is no real title available?)
• Theoretical informatics. An extensive introduction

This page was built for publication: Theoretical informatics

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