Machines that Can Output Empty Words

DOI10.1007/11821069_38MaRDI QIDQ5756669zbMATH OpenOpenAlexFDO

Authors Christian Glaßer, Stephen Travers

Publication date 5 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11821069_38

Mathematics Subject Classification ID

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

Recommendations

• Machines that can output empty words
• Machines, Computations, and Universality
• Languages polylog-time reducible to dot-depth 1/2
• Logspace and logtime leaf languages
• scientific article; zbMATH DE number 1405667

Cited in

(2)

• Machines that can output empty words
• The complexity of unions of disjoint sets

This page was built for publication: Machines that Can Output Empty Words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756669)