On relationship between term rewriting systems and regular tree languages

DOI10.1007/3-540-53904-2_105MaRDI QIDQ5055769zbMATH OpenOpenAlexWikidataFDO

Authors G. A. Kucherov

Publication date 9 December 2022

Published in Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-53904-2_105

Mathematics Subject Classification ID

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

Cites work

• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Explicit representation of terms defined by counter examples
• scientific article; zbMATH DE number 4016185 (Why is no real title available?)
• scientific article; zbMATH DE number 3854429 (Why is no real title available?)
• scientific article; zbMATH DE number 4164137 (Why is no real title available?)
• scientific article; zbMATH DE number 4164139 (Why is no real title available?)
• scientific article; zbMATH DE number 4164142 (Why is no real title available?)
• scientific article; zbMATH DE number 3943001 (Why is no real title available?)
• scientific article; zbMATH DE number 3956434 (Why is no real title available?)
• scientific article; zbMATH DE number 3729436 (Why is no real title available?)
• scientific article; zbMATH DE number 125892 (Why is no real title available?)
• Inductive proofs by specification transformations
• On Proving Uniform Termination and Restricted Termination of Rewriting Systems
• On relationship between term rewriting systems and regular tree languages
• On sufficient-completeness and related properties of term rewriting systems
• Reductions in tree replacement systems
• Semantic confluence tests and completion methods
• Sufficient-completeness, ground-reducibility and their complexity

Cited in

(10)

• Recognizable tree-languages and nonlinear morphisms
• Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy
• scientific article; zbMATH DE number 18637 (Why is no real title available?)
• On relationship between term rewriting systems and regular tree languages
• Open problems in rewriting
• Encompassment properties and automata with constraints
• More problems in rewriting
• Decidability of regularity and related properties of ground normal form languages
• Computing linearizations using test sets
• Solving divergence in Knuth--Bendix completion by enriching signatures

This page was built for publication: On relationship between term rewriting systems and regular tree languages

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