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

by Olivier Finkel, Michał Skrzypczak

Released as a article .

2014  

Abstract

We show that there are Σ_3^0-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 omega-languages accepted by non-deterministic Petri nets are topologically more complex than those accepted by deterministic Petri nets.
In text/plain format

Archived Files and Locations

application/pdf  141.2 kB
file_zn6e322xorgybhfwdpt7rse5qy
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2014-01-27
Version   v1
Language   en ?
arXiv  1401.6835v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: f3dd5dcc-8223-470d-81ec-68a1d7bd575b
API URL: JSON