 |
 |
Emmanuel Filiot ; Olivier Gauwin ; Pierre-Alain Reynier ; Frédéric Servais - Streamability of nested word transductions
lmcs:3763 - Logical Methods in Computer Science, April 4, 2019, Volume 15, Issue 2 - https://doi.org/10.23638/LMCS-15(2:1)2019We 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.
- Source : OpenAIRE Graph
- Extensions of Stream Processing; Funder: French National Research Agency (ANR); Code: ANR-13-JS02-0010
- Foundations of XML - Safe Processing of Dynamic Data over the Internet; Funder: European Commission; Code: 233599
