Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations

DOI10.1016/0304-3975(94)00303-3zbMath0871.68136OpenAlexW2053392028MaRDI QIDQ1351783

Sándor Vágvölgyi, Pál Gyenizse

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00303-3

zbMATH Keywords

linear timecomposition of tree transformation classes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Branching synchronization grammars with nested tables ⋮ Compositions with superlinear deterministic top-down tree transformations ⋮ Decidability of the finiteness of ranges of tree transductions ⋮ Linear deterministic multi bottom-up tree transducers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complete classification of deterministic root-to-frontier tree transformation classes
• A complete rewriting system for a monoid of tree transformation classes
• A complete description for a monoid of deterministic bottom-up tree transformation classes
• Top-down tree transducers with deterministic top-down look-ahead
• Bottom-up and top-down tree transformations— a comparison
• Top-down tree transducers with regular look-ahead

This page was built for publication: Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations