A criterion for proving noetherianity of a relation

DOI10.1016/0304-3975(92)90336-EzbMath0802.68072MaRDI QIDQ1186611

Patrick Dehornoy

Publication date: 28 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

distribution algebrascompletenessbinary relationlocally confluent relation

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42) Other combinatorial set theory (03E05)

Cites Work

• Thue systems as rewriting systems
• Free distributive groupoids
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A criterion for proving noetherianity of a relation