Over-approximating terms reachable by context-sensitive rewriting

DOI10.1007/978-3-319-24537-9_12MaRDI QIDQ1675159zbMATH OpenOpenAlexFDO

Authors Nirina Andrianarivelo, Pierre Réty

Publication date 27 October 2017

Full work available at URL https://doi.org/10.1007/978-3-319-24537-9_12

Mathematics Subject Classification ID

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

Recommendations

• Tree automata for rewrite strategies
• Synchronized tree languages for reachability in non-right-linear term rewrite systems
• scientific article; zbMATH DE number 2090069
• Regular sets of descendants by leftmost strategy
• Termination of context-sensitive rewriting

Cited in

(6)

• Tree automata for rewrite strategies
• Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy
• Synchronized tree languages for reachability in non-right-linear term rewrite systems
• Over-approximating descendants by synchronized tree languages
• Term rewriting with prefix context constraints and bottom-up strategies
• Automatically Proving and Disproving Feasibility Conditions

This page was built for publication: Over-approximating terms reachable by context-sensitive rewriting

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