Wordt geladen...
On the High Complexity of Petri Nets [Formula: see text]-Languages
We prove that [Formula: see text]-languages of (non-deterministic) Petri nets and [Formula: see text]-languages of (non-deterministic) Turing machines have the same topological complexity: the Borel and Wadge hierarchies of the class of [Formula: see text]-languages of (non-deterministic) Petri nets...
Bewaard in:
| Gepubliceerd in: | Application and Theory of Petri Nets and Concurrency |
|---|---|
| Hoofdauteur: | |
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
2020
|
| Onderwerpen: | |
| Online toegang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7324243/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-51831-8_4 |
| Tags: |
Voeg label toe
Geen labels, Wees de eerste die dit record labelt!
|