It is decidable whether a monadic thue system is canonical over a regular set
From MaRDI portal
Publication:3210188
DOI10.1007/BF02090778zbMATH Open0722.68071MaRDI QIDQ3210188FDOQ3210188
Publication date: 1990
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- The equivalence problem for deterministic finite-turn pushdown automata
- On ground-confluence of term rewriting systems
- On deciding the confluence of a finite string-rewriting system on a given congruence class
- Testing for the Church-Rosser property
- Thue systems as rewriting systems
- An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines
- The equivalence and inclusion problems for NTS languages
- On Proving Uniform Termination and Restricted Termination of Rewriting Systems
Cited In (3)
Recommendations
- A finite Thue system with decidable word problem and without equivalent finite canonical system 👍 👎
- Some undecidability results for non-monadic Church-Rosser Thue systems 👍 👎
- On countable chains having decidable monadic theory 👍 👎
- THE COMPLEXITY OF DECIDING CODE AND MONOID PROPERTIES FOR REGULAR SETS 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: It is decidable whether a monadic thue system is canonical over a regular set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210188)
