Universality Problem for Unambiguous VASS
From MaRDI portal
Cites work
- \(L(A)=L(B)\)? decidability results from complete formal systems
- A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton
- Finite state machines for strings over infinite alphabets
- LTL with the freeze quantifier and register automata
- On path equivalence of nondeterministic finite automata
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- Petri nets and regular processes
- Reachability in two-clock timed automata is PSPACE-complete
- Reducibility among combinatorial problems
- Regular separability of well-structured transition systems
- The containment problem for unambiguous register automata
- The covering and boundedness problems for vector addition systems
- Trace inclusion for one-counter nets revisited
- Unambiguity in automata theory
Cited in
(7)- scientific article; zbMATH DE number 7453188 (Why is no real title available?)
- scientific article; zbMATH DE number 7559503 (Why is no real title available?)
- Dimension-minimality and primality of counter nets
- Language inclusion for boundedly-ambiguous vector addition systems is decidable
- Bidimensional linear recursive sequences and universality of unambiguous register automata
- New techniques for universality in unambiguous register automata
- Languages of boundedly-ambiguous vector addition systems with states
This page was built for publication: Universality Problem for Unambiguous VASS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089303)
