On the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets
Logic in Computer Science
2014-01-28 v1 Computational Complexity
Formal Languages and Automata Theory
Abstract
We show that there are -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.
Keywords
Cite
@article{arxiv.1401.6835,
title = {On the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets},
author = {Olivier Finkel and Michał Skrzypczak},
journal= {arXiv preprint arXiv:1401.6835},
year = {2014}
}