scientific article; zbMATH DE number 193738

MaRDI QIDQ4040541zbMATH OpenFDO

Authors Franz Stetter

Publication date 5 June 1993

zbMATH Keywords

automatacomplexity of computationcomputabilityformal languagesgrammarsunsolvability

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Recommendations

• Publication:3468598
• scientific article; zbMATH DE number 805390
• Basics of theoretical computer science with applications. An introduction for students of computer science, business informatics and technical computer science
• scientific article; zbMATH DE number 946432
• scientific article; zbMATH DE number 877299

Cited in

(5)

• Sequential and parallel enumeration
• scientific article; zbMATH DE number 4135379 (Why is no real title available?)
• scientific article; zbMATH DE number 107959 (Why is no real title available?)
• scientific article; zbMATH DE number 192944 (Why is no real title available?)
• scientific article; zbMATH DE number 946432 (Why is no real title available?)

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