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

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

zbMATH Keywords

strategytree automatonTerm rewriting

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Decidable approximations of term rewriting systems
• Equality and disequality constraints on direct subterms in tree automata
• Automata for reduction properties solving
• Title not available (Why is that?)
• Title not available (Why is that?)
• Deterministic tree pushdown automata and monadic tree rewriting systems
• Linear generalized semi-monadic rewrite systems effectively preserve recognizability
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Unification of infinite sets of terms schematized by primal grammars
• Bottom-up tree pushdown automata and rewrite systems
• Reductions in tree replacement systems
• Rational tree relations
• Title not available (Why is that?)
• Regular sets of descendants by leftmost strategy
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (15)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
• Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy
• Over-approximating terms reachable by context-sensitive rewriting
• Bottom-up rewriting for words and terms
• Controlled term rewriting
• Regular sets of descendants by leftmost strategy
• Title not available (Why is that?)
• Closure of tree automata languages under innermost rewriting
• Sequentiality, monadic second-order logic and tree automata.
• Termination criteria for tree automata completion
• Restarting Tree Automata
• Title not available (Why is that?)
• Restricting tree grammars with term rewriting

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)