Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

STACS
2004
Springer

favoriteEmaildiscussreport

78views Theoretical Computer Science» more STACS 2004»

On the Expressiveness of Deterministic Transducers over Infinite Trees

14 years 4 months ago

On the Expressiveness of Deterministic Transducers over Infinite Trees

Download www-i7.informatik.rwth-aachen.de

Thomas Colcombet, Christof Löding

Real-time Traffic

STACS 2004 | Theoretical Computer Science |

claim paper

Related Content

» Expressiveness of streaming string transducers

» Minimization of Deterministic BottomUp Tree Transducers

» The Generating Power of Total Deterministic Tree Transducers

» Variable Automata over Infinite Alphabets

» A learning algorithm for topdown XML transformations

» Relating Tree Series Transducers and Weighted Tree Automata

» An Evaluation of Regular Path Expressions with Qualifiers against XML Streams

» Interactive learning of node selecting tree transducer

» Automata and Logics for Words and Trees over an Infinite Alphabet

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	STACS
Authors	Thomas Colcombet, Christof Löding

Comments (0)