CD-Systems of Restarting Automata
Hartmut Messerschmidt · Kobra (Universitätsbibliothek Kassel) · 2008
The exponential language together with these reductions can be used to separate L(det-R) from DCFL, because CFL, as well as DCFL, is closed under intersection with regular sets and inverse morphisms [HU79], too.Corollary 2.4.8.The language classes L(det-R) and CFL are incomparable with respect to inclusion.