L-Printable Sets
From MaRDI portal
Publication:4210140
computational complexityrankingcontext-free languagesKolmogorov complexitysparse setsregular languageslogspace\(L\)-isomorphisms
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30)
Recommendations
Cited in
(3)
This page was built for publication: L-Printable Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210140)