A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the topological complexity of ω-languages of non-deterministic Petri nets
2014
Information Processing Letters
We show that there are Σ 0 3 -complete languages of infinite words accepted by non-deterministic Petri nets with Büchi acceptance condition, or equivalently by Büchi blind counter automata. This shows that ω-languages accepted by non-deterministic Petri nets are topologically more complex than those accepted by deterministic Petri nets.
doi:10.1016/j.ipl.2013.12.007
fatcat:cilait532becthfv2isqnvuw3i