{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:21:25Z","timestamp":1776316885471,"version":"3.50.1"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2019,12,18]],"date-time":"2019-12-18T00:00:00Z","timestamp":1576627200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,12,18]],"date-time":"2019-12-18T00:00:00Z","timestamp":1576627200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,12,18]],"date-time":"2019-12-18T00:00:00Z","timestamp":1576627200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001665","name":"French National Research Agency","doi-asserted-by":"crossref","award":["ANR-17-CE40-0028"],"award-info":[{"award-number":["ANR-17-CE40-0028"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>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&amp;lt;\\omega^\\omega$, hence they are computationally more powerful than standard vector addition systems. On the other hand they cannot weakly compute the inverses $F_\\alpha^{-1}$ or indeed any sublinear function. The proof relies on a pumping lemma for runs of GVASes that is of independent interest.<\/jats:p>","DOI":"10.23638\/lmcs-15(4:15)2019","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:45:37Z","timestamp":1743702337000},"source":"Crossref","is-referenced-by-count":1,"title":["On Functions Weakly Computable by Pushdown Petri Nets and Related Systems"],"prefix":"10.23638","volume":"Volume 15, Issue 4","author":[{"given":"J.","family":"Leroux","sequence":"first","affiliation":[]},{"given":"M.","family":"Praveen","sequence":"additional","affiliation":[]},{"given":"Ph.","family":"Schnoebelen","sequence":"additional","affiliation":[]},{"given":"G.","family":"Sutre","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2019,12,18]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1904.04090v3","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1904.04090v3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:45:38Z","timestamp":1743702338000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/5362"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,18]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-15(4:15)2019","relation":{"has-preprint":[{"id-type":"arxiv","id":"1904.04090v2","asserted-by":"subject"},{"id-type":"arxiv","id":"1904.04090v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1904.04090","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1904.04090","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,18]]},"article-number":"5362"}}