Pages that link to "Item:Q1085618"
From MaRDI portal
The following pages link to Complexity of certain decision problems about congruential languages (Q1085618):
Displaying 14 items.
- On sufficient-completeness and related properties of term rewriting systems (Q1077161) (← 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)
- A note on regular classes in special Thue systems (Q1116708) (← links)
- An efficient algorithm to decide whether a monoid presented by a regular Church-Rosser Thue system is a group (Q1123272) (← links)
- Cancellativity in finitely presented semigroups (Q1824041) (← links)
- On equational theories, unification, and (un)decidability (Q1825184) (← links)
- The size of Higman-Haines sets (Q2465049) (← links)
- On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (Q2914714) (← links)
- One-rule semi-Thue systems with loops of length one, two or three (Q3126011) (← links)
- WHEN CHURCH-ROSSER BECOMES CONTEXT FREE (Q3401476) (← links)
- Church-Rosser codes (Q4608513) (← links)
- ON THE DESCRIPTIONAL COMPLEXITY OF THE WINDOW SIZE FOR DELETING RESTARTING AUTOMATA (Q5401559) (← links)
- On public-key cryptosystem based on Church-Rosser string-rewriting systems (Q6064030) (← links)
