Deterministic bottom-up tree transducers and ground term rewrite systems

DOI10.1016/J.TCS.2009.02.040MaRDI QIDQ1019744zbMATH OpenOpenAlexFDO

Authors Sándor Vágvölgyi

Publication date 28 May 2009

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

Full work available at URL https://doi.org/10.1016/j.tcs.2009.02.040

zbMATH Keywords

bottom-up tree automatonbottom-up tree transducerground term rewrite system

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Recommendations

• Bottom-up tree pushdown automata and rewrite systems
• Deterministic tree pushdown automata and monadic tree rewriting systems
• Deterministic top-down tree transducers with iterated look-ahead
• Synthesis of deterministic top-down tree transducers from automatic tree relations
• Synthesis of deterministic top-down tree transducers from automatic tree relations
• Minimization of deterministic bottom-up tree transducers
• Linear deterministic multi bottom-up tree transducers
• Definability results for top-down tree transducers
• Definability Results for Top-Down Tree Transducers
• Bottom-up tree pushdown automata: Classification and connection with rewrite systems

Cites work

• scientific article; zbMATH DE number 3714978 (Why is no real title available?)
• scientific article; zbMATH DE number 3615891 (Why is no real title available?)
• scientific article; zbMATH DE number 3622977 (Why is no real title available?)
• A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
• Abstract regular tree model checking
• Congruential complements of ground term rewrite systems
• Minimal equational representations of recognizable tree languages
• Term rewriting restricted to ground terms.

Cited in

(15)

• Restricted ground tree transducers
• Bottom-up tree pushdown automata and rewrite systems
• Definability Results for Top-Down Tree Transducers
• Undecidable properties of deterministic top-down tree transducers
• scientific article; zbMATH DE number 1530017 (Why is no real title available?)
• scientific article; zbMATH DE number 5654542 (Why is no real title available?)
• Determinacy and Rewriting of Top-Down and MSO Tree Transformations
• On ground tree transformations and congruences induced by tree automata.
• Superlinear deterministic top-down tree transducers
• Determinacy and subsumption for single-valued bottom-up tree transducers
• Earliest normal form and minimization for bottom-up tree transducers
• Synthesis of deterministic top-down tree transducers from automatic tree relations
• The ground tree transducer game with identical tree automata
• scientific article; zbMATH DE number 6131600 (Why is no real title available?)
• scientific article; zbMATH DE number 18637 (Why is no real title available?)

This page was built for publication: Deterministic bottom-up tree transducers and ground term rewrite systems

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