On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets (Q2446063): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2013.12.007 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2013.12.007 / rank | |||
Normal rank | |||
Latest revision as of 16:36, 18 December 2024
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
