A characterization of reversal-bounded multipushdown machine languages
We prove that DLOG is equal to the class of languages recognized by deterministic reversal-bounded multipushdown machines.
deterministic reversal-bounded multipushdown machines
scientific article; zbMATH DE number 3902072