Pages that link to "Item:Q791314"
From MaRDI portal
The following pages link to Finite complete rewriting systems and the complexity of word problem (Q791314):
Displaying 33 items.
- A strong geometric hyperbolicity property for directed graphs and monoids. (Q743919) (← links)
- About the descriptive power of certain classes of finite string-rewriting systems (Q910850) (← links)
- On ground-confluence of term rewriting systems (Q913496) (← links)
- A note on a special one-rule semi-Thue system (Q1067781) (← links)
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups (Q1074716) (← links)
- n-level rewriting systems (Q1084855) (← links)
- Complete semi-Thue systems for abelian groups (Q1087012) (← links)
- The problems of cyclic equality and conjugacy for finite complete rewriting systems (Q1089798) (← links)
- A catalogue of complete group presentations (Q1097968) (← 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)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Complexity, combinatorial group theory and the language of palutators (Q1105698) (← links)
- Pseudo-natural algorithms for finitely generated presentations of monoids and groups (Q1115973) (← links)
- Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages (Q1120292) (← links)
- A field guide to equational logic (Q1201350) (← links)
- A finiteness condition for rewriting systems (Q1331943) (← links)
- Some results on the confluence property of combined term rewriting systems (Q1337642) (← links)
- Constructing finitely presented monoids which have no finite complete presentation (Q1357103) (← links)
- For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide (Q1399171) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- Confluence problems for trace rewriting systems (Q1854457) (← links)
- The word problem for one-relation monoids: a survey (Q1982573) (← links)
- Confluence of Graph Rewriting with Interfaces (Q2988637) (← links)
- COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA (Q3056281) (← links)
- Finite canonical rewriting systems for congruences generated by concurrency relations (Q3779772) (← links)
- SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID (Q4786319) (← links)
- An equational logic sampler (Q5055725) (← links)
- Restrictions of congruences generated by finite canonical string-rewriting systems (Q5055732) (← links)
- Incremental termination proofs and the length of derivations (Q5055748) (← links)
- DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS (Q5462671) (← links)
- String diagram rewrite theory III: Confluence with and without Frobenius (Q5879265) (← links)
- On public-key cryptosystem based on Church-Rosser string-rewriting systems (Q6064030) (← links)
