scientific article; zbMATH DE number 54171

MaRDI QIDQ4004355zbMATH OpenFDO

Authors Uwe Schöning

Publication date 23 January 1993

zbMATH Keywords

computational complexityautomatadecidabilityformal languages

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of computing (68Qxx) Computability and recursion theory (03Dxx)

Recommendations

• scientific article; zbMATH DE number 3909745
• Introduction to theoretical computer science. Foundations and models
• Theory of computation
• Basic course theoretical computer science with exercises and test questions.
• scientific article; zbMATH DE number 43003

Cited in

(9)

• scientific article; zbMATH DE number 3909745 (Why is no real title available?)
• scientific article; zbMATH DE number 1220163 (Why is no real title available?)
• scientific article; zbMATH DE number 108371 (Why is no real title available?)
• Persistent Computations of Turing Machines
• scientific article; zbMATH DE number 3902039 (Why is no real title available?)
• scientific article; zbMATH DE number 3965406 (Why is no real title available?)
• Introduction to theoretical computer science. Foundations and models
• scientific article; zbMATH DE number 5778850 (Why is no real title available?)
• Basic course theoretical computer science with exercises and test questions.

This page was built for publication:

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