Computing linearizations using test sets

DOI10.1007/3-540-56393-8_21OpenAlexW1486181337MaRDI QIDQ5881192

Maria Huber, Dieter Hofbauer

Publication date: 9 March 2023

Published in: Conditional Term Rewriting Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56393-8_21

Mathematics Subject Classification ID

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

Related Items (2)

More problems in rewriting ⋮ The HOM Problem is EXPTIME-Complete

Cites Work

• 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
• Semantic confluence tests and completion methods
• Computing ground reducibility and inductively complete positions
• On relationship between term rewriting systems and regular tree languages

This page was built for publication: Computing linearizations using test sets