Streamability of nested word transductions

Abstract : 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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02103898
Contributor : Olivier Gauwin <>
Submitted on : Thursday, April 18, 2019 - 10:13:29 PM
Last modification on : Thursday, July 4, 2019 - 3:56:24 PM

Links full text

Identifiers

  • HAL Id : hal-02103898, version 1
  • ARXIV : 1707.00527

Citation

Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais. Streamability of nested word transductions. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2019. ⟨hal-02103898⟩

Share

Metrics

Record views

30