I'm wondering if anyone can point me to either an algorithm or an undecidability proof for the following question:Given a non-deterministic reversal-bounded multicounter machine $M$,is there some deterministic reversal-bounded multicounter machine $M'$such that $L(M) = L(M')$?For anyone interested, reversal-bounded counter machines are described at lengthin Oscar Ibarra's Paper about them.
Is it decidable whether the langauge accepted by a reversal-bounded counter machine is deterministic?
reference request;fl.formal languages;computability;automata theory;decidability