Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMATH Open1156.68388OpenAlexW2494705596MaRDI QIDQ5492908FDOQ5492908

Authors: Falk Unger 

Publication date: 20 October 2006

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

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

Recommendations

• Very Sparse Leaf Languages
• Logspace and logtime leaf languages
• A characterization of the leaf language classes
• Generic separations and leaf languages
• Machines, Computations, and Universality

zbMATH Keywords

Computational ComplexitySeedsSparsenessLeaf Languages

Mathematics Subject Classification ID

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

Cited In (4)

• PICCOLA -- a small composition language
• A characterization of the leaf language classes
• Machines, Computations, and Universality
• Very Sparse Leaf Languages

This page was built for publication: Mathematical Foundations of Computer Science 2005

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