Publication:4004355

zbMath0797.68001MaRDI QIDQ4004355

Uwe Schoening

Publication date: 23 January 1993

zbMATH Keywords

computational complexity; automata; decidability; formal languages

Mathematics Subject Classification ID

68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science

68Qxx: Theory of computing

03Dxx: Computability and recursion theory

Related Items

Persistent Computations of Turing Machines