Deterministic bottom-up tree transducers and ground term rewrite systems

DOI10.1016/J.TCS.2009.02.040zbMATH Open1171.68018OpenAlexW2009459103MaRDI QIDQ1019744FDOQ1019744

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

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

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)

Cites Work

• Title not available (Why is that?)
• Abstract regular tree model checking
• A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
• Term rewriting restricted to ground terms.
• Congruential complements of ground term rewrite systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimal equational representations of recognizable tree languages

Cited In (15)

• Definability Results for Top-Down Tree Transducers
• Title not available (Why is that?)
• Undecidable properties of deterministic top-down tree transducers
• Bottom-up tree pushdown automata and rewrite systems
• On ground tree transformations and congruences induced by tree automata.
• The ground tree transducer game with identical tree automata
• Earliest normal form and minimization for bottom-up tree transducers
• Title not available (Why is that?)
• Determinacy and subsumption for single-valued bottom-up tree transducers
• Superlinear deterministic top-down tree transducers
• Determinacy and Rewriting of Top-Down and MSO Tree Transformations
• Synthesis of deterministic top-down tree transducers from automatic tree relations
• Title not available (Why is that?)
• Restricted ground tree transducers
• Title not available (Why is that?)

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)