scientific article; zbMATH DE number 1361501

MaRDI QIDQ4699320zbMATH OpenFDO

Authors Arfst Nickelsen

Publication date 1997

zbMATH Keywords

Turing machine

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Comparing verboseness for finite automata and Turing machines
• On polynomially \(\mathcal{D}\)-verbose sets
• scientific article; zbMATH DE number 2086408
• Terse, superterse, and verbose sets

Cited in

(3)

• scientific article; zbMATH DE number 2086408 (Why is no real title available?)
• Comparing verboseness for finite automata and Turing machines
• On polynomially \(\mathcal{D}\)-verbose sets

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