Emergent Mind

On the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets

(1401.6835)

Published Jan 27, 2014 in cs.LO , cs.CC , and cs.FL

Abstract

We show that there are $\Sigma_3^0$-complete languages of infinite words accepted by non-deterministic Petri nets with B\"uchi acceptance condition, or equivalently by B\"uchi blind counter automata. This shows that omega-languages accepted by non-deterministic Petri nets are topologically more complex than those accepted by deterministic Petri nets.

We're not able to analyze this paper right now due to high demand.

Please check back later (sorry!).

Generate a summary of this paper on our Pro plan:

We ran into a problem analyzing this paper.