Results 1 
4 of
4
Streamability of Nested Word Transductions
"... We consider the problem of evaluating in streaming (i.e. in a single lefttoright 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 ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We consider the problem of evaluating in streaming (i.e. in a single lefttoright 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
Streamable Fragments of Forward XPath
 16TH INTERNATIONAL CONFERENCE ON IMPLEMENTATION AND APPLICATION OF AUTOMATA
, 2011
"... We present a query answering algorithm for a fragment of Forward XPath on Xml streams that we obtain by compilation to deterministic nested word automata. Our algorithm is earliest and in polynomial time. This proves the finite streamability of the fragment of Forward XPath with child steps, outerm ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
We present a query answering algorithm for a fragment of Forward XPath on Xml streams that we obtain by compilation to deterministic nested word automata. Our algorithm is earliest and in polynomial time. This proves the finite streamability of the fragment of Forward XPath with child steps
HeightBounded Memory Visibly Pushdown Transductions
"... We consider the problem of the streaming evaluation (i.e. in a single lefttoright pass) of a nested word transduction with a limited amount of memory. A transduction T is said to be bounded memory – BM (resp. height bounded memory – HBM) if it can be evaluated with a memory that depends only on t ..."
Abstract
 Add to MetaCart
We consider the problem of the streaming evaluation (i.e. in a single lefttoright pass) of a nested word transduction with a limited amount of memory. A transduction T is said to be bounded memory – BM (resp. height bounded memory – HBM) if it can be evaluated with a memory that depends only
Properties of Visibly Pushdown Transducers
 35TH INTERNATIONAL SYMPOSIUM ON MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
, 2010
"... Visibly pushdown transducers (VPTs) form a strict subclass of pushdown transducers (PTs) that extends finite state transducers with a stack. Like visibly pushdown automata, the input symbols determine the stack operations. It has been shown that visibly pushdown languages form a robust subclass of ..."
Abstract

Cited by 20 (5 self)
 Add to MetaCart
of contextfree languages. Along the same line, we show that word transductions defined by VPTs enjoy strong properties, in contrast to PTs. In particular, functionality is decidable in PTIME, kvaluedness is in NPTIME and equivalence of (nondeterministic) functional VPTs is EXPTIMEC. Those problems