2000 character limit reached
On the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets
Published 27 Jan 2014 in cs.LO, cs.CC, and cs.FL | (1401.6835v1)
Abstract: We show that there are $\Sigma_30$-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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
