Some undecidability results for weakly confluent monadic string-rewriting systems
From MaRDI portal
Recommendations
- On weakly confluent monadic string-rewriting systems
- Decision problems for finite special string-rewriting systems that are confluent on some congruence class
- scientific article; zbMATH DE number 789389
- On deciding whether a monoid is a free monoid or is a group
- On deciding the confluence of a finite string-rewriting system on a given congruence class
Cited in
(14)- On deciding the confluence of a finite string-rewriting system on a given congruence class
- It is undecidable whether a finite special string-rewriting system presents a group
- Some properties of finite special string-rewriting systems
- On deciding confluence of finite string-rewriting systems modulo partial commutativity
- Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids
- Computing presentations for subgroups of polycyclic groups and of context-free groups
- Codes modulo finite monadic string-rewriting systems
- Some results on Green's relations for monoids presented by monadic string-rewriting systems
- Linear bounded automata and rewrite systems: influence of initial configurations on decision properties
- Decidable sentences for context-free groups
- The word matching problem is undecidable for finite special string-rewriting systems that are confluent
- scientific article; zbMATH DE number 789389 (Why is no real title available?)
- Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general
- On weakly confluent monadic string-rewriting systems
This page was built for publication: Some undecidability results for weakly confluent monadic string-rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038766)