On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets (Q2446063)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets |
scientific article |
Statements
On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets (English)
0 references
15 April 2014
0 references
formal languages
0 references
languages of infinite words
0 references
Petri nets
0 references
Büchi acceptance condition
0 references
Cantor space
0 references
topological complexity
0 references
Borel hierarchy
0 references
complete sets
0 references
