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 the normal view instead:
scientific article; zbMATH DE number 6285170
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets |
scientific article; zbMATH DE number 6285170 |
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
0.9153724908828736
0 references
0.8984895944595337
0 references
0.8036484122276306
0 references
0.803091287612915
0 references
0.8011370301246643
0 references
