Language inclusion for boundedly-ambiguous vector addition systems is decidable
From MaRDI portal
Cites work
- Decidability of weak simulation on one-counter nets
- Finite state machines for strings over infinite alphabets
- Finiteness of the odd perfect and primitive abundant numbers with \(n\) distinct prime factors.
- Language inclusion for boundedly-ambiguous vector addition systems is decidable
- Language inclusion for boundedly-ambiguous vector addition systems is decidable
- LTL with the freeze quantifier and register automata
- Nonprimitive recursive complexity and undecidability for Petri net equivalences
- On path equivalence of nondeterministic finite automata
- On the definition of a family of automata
- Reachability in Petri nets with inhibitor arcs
- Reachability in vector addition systems is Ackermann-complete
- Reachability in vector addition systems is primitive-recursive in fixed dimension
- Regular separability of well-structured transition systems
- Some decision problems related to the reachability problem for Petri nets
- The containment problem for unambiguous register automata
- The covering and boundedness problems for vector addition systems
- The equality problem for vector addition systems is undecidable
- The ideal view on Rackoff's coverability technique
- The reachability problem for Petri nets is not primitive recursive
- The Reachability Problem for Vector Addition System with One Zero-Test
- Trace inclusion for one-counter nets revisited
- Unambiguity in automata theory
- Unambiguous constrained automata
- Undecidability of bisimilarity for Petri nets and some related problems
- Une extension d'un théorème de P. Jullien sur les âges de mots
- Universality Problem for Unambiguous VASS
- Well-structured transition systems everywhere!
Cited in
(2)
This page was built for publication: Language inclusion for boundedly-ambiguous vector addition systems is decidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7007744)
