On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
Olivier Finkel,
Michał Skrzypczak
Abstract:We prove that ω-languages of (non-deterministic) Petri nets and ωlanguages of (non-deterministic) Turing machines have the same topological complexity: the Borel and Wadge hierarchies of the class of ωlanguages of (non-deterministic) Petri nets are equal to the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Turing machines. We also show that it is highly undecidable to determine the topological complexity of a Petri net ω-language. Moreover, we infer from the proofs of the above… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.