On Functions Weakly Computable by Pushdown Petri Nets and Related Systems
We consider numerical functions weakly computable by grammar-controlled vector addition systems (GVASes, a variant of pushdown Petri nets). GVASes can weakly compute all fast growing functions $F_\alpha$ for $\alpha<\omega^\omega$, hence they are computationally more powerful than standard vector...
| Auteurs principaux: | , , , |
|---|---|
| Format: | Article |
| Langue: | English |
| Publié: |
Logical Methods in Computer Science e.V.
2019-12-01
|
| Collection: | Logical Methods in Computer Science |
| Sujets: | |
| Accès en ligne: | https://lmcs.episciences.org/5362/pdf |