Language Equivalence Between Deterministic One-Counter Automata and Nondeterministic One-Counter Nets Is Decidable
As a continuation of our previous work, we publish the paper resolving the open Automata Exchange Problem 24.04(A) by showing that the problem is decidable. Unlike Problem 24.04(B), Problem 24.04(A) was not stated precisely enough to make clear whether epsilon-moves were included in the model. For this reason, we solve...