Details

Autor(en) / Beteiligte

• Filiot, Emmanuel
• Gauwin, Olivier
• Reynier, Pierre-Alain
• Servais, Frédéric

Titel

Streamability of nested word transductions

Ist Teil von

• Logical methods in computer science, 2019-01, Vol.15, Issue 2

Ort / Verlag

Logical Methods in Computer Science Association

Erscheinungsjahr

2019

Link zum Volltext

Quelle

EZB Free E-Journals

Beschreibungen/Notizen

• 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.