English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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

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