Universality Problem for Unambiguous VASS

DOI10.4230/LIPIcs.CONCUR.2020.36OpenAlexW3007472440MaRDI QIDQ5089303

Diego Figueira, Wojciech Czerwiński, Piotr Hofman

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/2007.10907

zbMATH Keywords

unambiguityvector addition systemsuniversality problems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• The covering and boundedness problems for vector addition systems
• On path equivalence of nondeterministic finite automata
• \(L(A)=L(B)\)? decidability results from complete formal systems
• Petri nets and regular processes
• Reachability in two-clock timed automata is PSPACE-complete
• LTL with the freeze quantifier and register automata
• Trace Inclusion for One-Counter Nets Revisited
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
• Reducibility among Combinatorial Problems
• A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton
• The Containment Problem for Unambiguous Register Automata
• Finite state machines for strings over infinite alphabets
• Unambiguity in Automata Theory

This page was built for publication: Universality Problem for Unambiguous VASS