scientific article; zbMATH DE number 1361501

zbMATH Open0947.68069MaRDI QIDQ4699320FDOQ4699320

Authors: Arfst Nickelsen 

Publication date: 1997

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

Turing machine

Mathematics Subject Classification ID

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

Cited In (3)

• On polynomially \(\mathcal{D}\)-verbose sets
• Comparing verboseness for finite automata and Turing machines
• Title not available (Why is that?)

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)