Cargando…
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...
Autor principal: | Finkel, Olivier |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7324243/ http://dx.doi.org/10.1007/978-3-030-51831-8_4 |
Ejemplares similares
-
Cycl[Formula: see text]n – A Tool for Determining Stop-Transitions of Petri Nets
por: Desel, Jörg, et al.
Publicado: (2020) -
Transition Property for [Formula: see text]-Power Free Languages with [Formula: see text] and [Formula: see text] Letters
por: Rukavicka, Josef
Publicado: (2020) -
Observation of B[Formula: see text]
[Formula: see text]
[Formula: see text] (2S)K[Formula: see text] and B[Formula: see text]
[Formula: see text]
[Formula: see text] (2S)K[Formula: see text] decays
por: Tumasyan, A., et al.
Publicado: (2022) -
[Formula: see text] rule, [Formula: see text] and [Formula: see text] in [Formula: see text] and [Formula: see text] models with FCNC quark couplings
por: Buras, Andrzej J., et al.
Publicado: (2014) -
Petri nets and ODEs as complementary methods for comprehensive analysis on an example of the ATM–p53–NF-[Formula: see text] B signaling pathways
por: Gutowska, Kaja, et al.
Publicado: (2022)