Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case
Tomáš Masopust · Fundamenta Informaticae · 2010
We continue the investigation of pushdown automata which are allowed to make a non-deterministic decision if and only if their pushdown content forms a string belonging to a given control language. We prove that if the control language is linear and