Büchi VASS recognise \(\mathbf{\Sigma}^{1}_{1}\)-complete \({\omega}\)-languages

DOI10.1007/978-3-030-00250-3_10zbMath1475.68214OpenAlexW2888894103MaRDI QIDQ1798916

Michał Skrzypczak

Publication date: 23 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-030-00250-3_10

zbMATH Keywords

Petri netsnondeterminisminfinite words

Mathematics Subject Classification ID

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

Related Items (2)

On the High Complexity of Petri Nets $$\omega $$-Languages ⋮ On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words

This page was built for publication: Büchi VASS recognise \(\mathbf{\Sigma}^{1}_{1}\)-complete \({\omega}\)-languages