On relationship between term rewriting systems and regular tree languages

DOI10.1007/3-540-53904-2_105zbMath1503.68126OpenAlexW1523609153WikidataQ58064555 ScholiaQ58064555MaRDI QIDQ5055769

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

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

Related Items (8)

Computing linearizations using test sets ⋮ On relationship between term rewriting systems and regular tree languages ⋮ Open problems in rewriting ⋮ Encompassment properties and automata with constraints ⋮ More problems in rewriting ⋮ Solving divergence in Knuth--Bendix completion by enriching signatures ⋮ Decidability of regularity and related properties of ground normal form languages ⋮ Recognizable tree-languages and nonlinear morphisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On sufficient-completeness and related properties of term rewriting systems
• Reductions in tree replacement systems
• Explicit representation of terms defined by counter examples
• Sufficient-completeness, ground-reducibility and their complexity
• On Proving Uniform Termination and Restricted Termination of Rewriting Systems
• Semantic confluence tests and completion methods
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Inductive proofs by specification transformations
• On relationship between term rewriting systems and regular tree languages

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