scientific article; zbMATH DE number 1405449

MaRDI QIDQ4938423zbMATH OpenFDO

Authors Pierre Réty

Publication date 22 February 2002

zbMATH Keywords

term rewritingtree automata

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2090069
• Regular sets of descendants by leftmost strategy
• Tree automata for rewrite strategies
• Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
• scientific article; zbMATH DE number 1390088

Cited in

(10)

• Tree automata for rewrite strategies
• Regular sets of descendants by leftmost strategy
• Reachability analysis of innermost rewriting
• scientific article; zbMATH DE number 4164137 (Why is no real title available?)
• scientific article; zbMATH DE number 4049112 (Why is no real title available?)
• scientific article; zbMATH DE number 2090069 (Why is no real title available?)
• scientific article; zbMATH DE number 1390088 (Why is no real title available?)
• Reachability analysis over term rewriting systems
• Termination criteria for tree automata completion
• Descendants of a recognizable tree language for sets of linear monadic term rewrite rules

This page was built for publication:

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