scientific article; zbMATH DE number 1954390

MaRDI QIDQ4415261zbMATH OpenFDO

Authors Sebastian Maneth

Publication date 28 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2556/25560265.htm

zbMATH Keywords

complexitydeterministic macro tree transducers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
• Output string languages of compositions of deterministic macro tree transducers
• scientific article; zbMATH DE number 3965457
• Pushdown machines for the macro tree transducer
• scientific article; zbMATH DE number 2087226

Cited in

(23)

• The time complexity of typechecking tree-walking tree transducers
• Macro forest transducers
• Compositions with superlinear deterministic top-down tree transformations
• Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations
• A comparison of pebble tree transducers with macro tree transducers
• Output string languages of compositions of deterministic macro tree transducers
• The complexity of the exponential output size problem for top-down and bottom-up tree transducers
• Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
• Static garbage collection
• Formal efficiency analysis for tree transducer composition
• The Complexity of Tree Transducer Output Languages
• scientific article; zbMATH DE number 3965457 (Why is no real title available?)
• scientific article; zbMATH DE number 1330139 (Why is no real title available?)
• scientific article; zbMATH DE number 2087226 (Why is no real title available?)
• scientific article; zbMATH DE number 1390067 (Why is no real title available?)
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Foundations of Software Science and Computation Structures
• The output size problem for string-to-tree transducers
• Circularity, composition, and decomposition results for pebble macro tree transducers
• A pumping lemma for output languages of macro tree transducers
• On the tree-transformation power of XSLT
• The complexity of tree automata and XPath on grammar-compressed trees
• Automata for XML -- a survey

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4415261)