Similar Items: Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable
- Ambiguity of {omega}-Languages of Turing Machines
- Vector Addition System Reversible Reachability Problem
- Bounded Reachability Problems are Decidable in FIFO Machines
- Ambiguity Hierarchy of Regular Infinite Tree Languages
- The Complexity of Reachability in Affine Vector Addition Systems with States
- Affine Extensions of Integer Vector Addition Systems with States