The Extended Chomsky Hierarchy Reloaded Decidable Presburger arithmetic … EXPSPACE ? … H H EXPTIME … Turing PSPACE BPP … PH … degrees … Context sensitive LBA … NP … … P anbncn … Not finitely describable EXPSPACE-complete =RE Context-free wwR PSPACE-complete QBF EXPTIME-complete Go Det. CF anbn NP-complete SAT Not Recognizable … Regular a* Recognizable … … Finite {a,b} … Dense infinite time & space complexity hierarchies … Other infinite complexity & descriptive hierarchies …
Blueberry Muffin Turing Machines L(M) = {w | wÎS*, w=wR}