Filiot, Emmanuel and Gauwin, Olivier and Reynier, Pierre-Alain and Servais, Frédéric - Streamability of nested word transductions

lmcs:3763 - Logical Methods in Computer Science, April 4, 2019, Volume 15, Issue 2
Streamability of nested word transductions

Authors: Filiot, Emmanuel and Gauwin, Olivier and Reynier, Pierre-Alain and Servais, Frédéric

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.


Source : oai:arXiv.org:1707.00527
Volume: Volume 15, Issue 2
Published on: April 4, 2019
Submitted on: July 4, 2017
Keywords: Computer Science - Formal Languages and Automata Theory


Share