Tree automata for rewrite strategies

DOI10.1016/J.JSC.2004.12.008zbMATH Open1129.68036OpenAlexW1967797973MaRDI QIDQ2456572FDOQ2456572

Authors Pierre Réty, Julie Vuotto

Publication date 19 October 2007

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jsc.2004.12.008

zbMATH Keywords

strategytree automatonTerm rewriting

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2090069
• Regular sets of descendants by leftmost strategy
• Publication:4938423
• Publication:4934355
• Over-approximating terms reachable by context-sensitive rewriting

Cites work

• scientific article; zbMATH DE number 1614701 (Why is no real title available?)
• scientific article; zbMATH DE number 1615242 (Why is no real title available?)
• scientific article; zbMATH DE number 1705162 (Why is no real title available?)
• scientific article; zbMATH DE number 1722706 (Why is no real title available?)
• scientific article; zbMATH DE number 48157 (Why is no real title available?)
• scientific article; zbMATH DE number 176501 (Why is no real title available?)
• scientific article; zbMATH DE number 1512609 (Why is no real title available?)
• scientific article; zbMATH DE number 2087437 (Why is no real title available?)
• scientific article; zbMATH DE number 2090067 (Why is no real title available?)
• scientific article; zbMATH DE number 2090069 (Why is no real title available?)
• scientific article; zbMATH DE number 1405449 (Why is no real title available?)
• Automata for reduction properties solving
• Bottom-up tree pushdown automata and rewrite systems
• Decidable approximations of term rewriting systems
• Deterministic tree pushdown automata and monadic tree rewriting systems
• Equality and disequality constraints on direct subterms in tree automata
• Linear generalized semi-monadic rewrite systems effectively preserve recognizability
• Rational tree relations
• Reductions in tree replacement systems
• Regular sets of descendants by leftmost strategy
• Unification of infinite sets of terms schematized by primal grammars

Cited in

(15)

• Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy
• Regular sets of descendants by leftmost strategy
• Restarting Tree Automata
• Termination criteria for tree automata completion
• Controlled term rewriting
• Restricting tree grammars with term rewriting
• Over-approximating terms reachable by context-sensitive rewriting
• Bottom-up rewriting for words and terms
• scientific article; zbMATH DE number 1405449 (Why is no real title available?)
• Sequentiality, monadic second-order logic and tree automata.
• scientific article; zbMATH DE number 1615227 (Why is no real title available?)
• Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
• Closure of tree automata languages under innermost rewriting
• scientific article; zbMATH DE number 4157904 (Why is no real title available?)
• scientific article; zbMATH DE number 4164137 (Why is no real title available?)

This page was built for publication: Tree automata for rewrite strategies

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