scientific article; zbMATH DE number 1371320

MaRDI QIDQ3835841zbMATH OpenFDO

Authors Ingo Wegener

Publication date 29 November 1999

zbMATH Keywords

computabilitycontext-free grammarsfinite automataNP-completenessTuring machines

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

• scientific article; zbMATH DE number 2229972
• scientific article; zbMATH DE number 1453448
• Theoretic computer science. An introduction
• scientific article; zbMATH DE number 108379
• Theoretical computer science -- in brief
• scientific article; zbMATH DE number 824078
• scientific article; zbMATH DE number 1024635

Cited in

(3)

• Algorithmic concepts of informatics. Computability, complexity theory, algorithmics, cryptography. An introduction
• scientific article; zbMATH DE number 54110 (Why is no real title available?)
• Current Trends in Theoretical Computer Science

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 Q3835841)