The following pages link to Infinite regular Thue systems (Q1839248):
Displaying 31 items.
- Decidable sentences of Church-Rosser congruences (Q593775) (← links)
- A finitely presented monoid which has solvable word problem but has no regular complete presentation (Q673144) (← links)
- On weakly confluent monadic string-rewriting systems (Q685433) (← links)
- Insertion languages (Q796994) (← links)
- The undecidability of the preperfectness of Thue systems (Q797574) (← links)
- Homogeneous Thue systems and the Church-Rosser property (Q798317) (← links)
- Some decision problems about controlled rewriting systems (Q910246) (← links)
- About the descriptive power of certain classes of finite string-rewriting systems (Q910850) (← links)
- A characterisation of deterministic context-free languages by means of right-congruences (Q913524) (← links)
- Some undecidability results for non-monadic Church-Rosser Thue systems (Q1057264) (← links)
- Complexity results on the conjugacy problem for monoids (Q1073015) (← links)
- The equivalence and inclusion problems for NTS languages (Q1083219) (← links)
- Complexity of certain decision problems about congruential languages (Q1085618) (← links)
- On the regular equivalence problem for regular Thue systems (Q1087011) (← links)
- The problems of cyclic equality and conjugacy for finite complete rewriting systems (Q1089798) (← links)
- Thue systems as rewriting systems (Q1099642) (← links)
- On deciding the confluence of a finite string-rewriting system on a given congruence class (Q1102946) (← links)
- Pseudo-natural algorithms for finitely generated presentations of monoids and groups (Q1115973) (← links)
- An efficient algorithm to decide whether a monoid presented by a regular Church-Rosser Thue system is a group (Q1123272) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
- When is a monoid a group? The Church-Rosser case is tractable (Q1166924) (← links)
- Some undecidability results concerning the property of preserving regularity (Q1274984) (← links)
- Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions. (Q1399980) (← links)
- Regular Gröbner bases (Q1599541) (← links)
- Undecidable questions related to Church-Rosser Thue systems (Q1839249) (← links)
- Infinite complete group presentations (Q1916428) (← links)
- A note on thue systems with a single defining relation (Q3735697) (← links)
- Church-Rosser systems with respect to formal languages (Q3796797) (← links)
- THE PROPERTY FDT IS UNDECIDABLE FOR FINITELY PRESENTED MONOIDS THAT HAVE POLYNOMIAL-TIME DECIDABLE WORD PROBLEMS (Q4786249) (← links)
- KNUTH–BENDIX FOR GROUPS WITH INFINITELY MANY RULES (Q4786262) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q5055831) (← links)
