{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:38:44Z","timestamp":1753889924576,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T00:00:00Z","timestamp":1554336000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T00:00:00Z","timestamp":1554336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T00:00:00Z","timestamp":1554336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["233599"],"award-info":[{"award-number":["233599"]}],"id":[{"id":"10.13039\/501100000780","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 the problem of evaluating in streaming (i.e., in a single left-to-right pass) a nested word transduction with a limited amount of memory. A transduction T is said to be height bounded memory (HBM) if it can be evaluated with a memory that depends only on the size of T and on the height of the input word. We show that it is decidable in coNPTime for a nested word transduction defined by a visibly pushdown transducer (VPT), if it is HBM. In this case, the required amount of memory may depend exponentially on the height of the word. We exhibit a sufficient, decidable condition for a VPT to be evaluated with a memory that depends quadratically on the height of the word. This condition defines a class of transductions that strictly contains all determinizable VPTs.<\/jats:p>","DOI":"10.23638\/lmcs-15(2:1)2019","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:33:08Z","timestamp":1743701588000},"source":"Crossref","is-referenced-by-count":0,"title":["Streamability of nested word transductions"],"prefix":"10.23638","volume":"Volume 15, Issue 2","author":[{"given":"Emmanuel","family":"Filiot","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Gauwin","sequence":"additional","affiliation":[]},{"given":"Pierre-Alain","family":"Reynier","sequence":"additional","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Servais","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2019,4,4]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1707.00527v3","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1707.00527v3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:33:08Z","timestamp":1743701588000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/3763"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,4]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-15(2:1)2019","relation":{"has-preprint":[{"id-type":"arxiv","id":"1707.00527v2","asserted-by":"subject"},{"id-type":"arxiv","id":"1707.00527v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1707.00527","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1707.00527","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2019,4,4]]},"article-number":"3763"}}