Pages that link to "Item:Q910850"
From MaRDI portal
The following pages link to About the descriptive power of certain classes of finite string-rewriting systems (Q910850):
Displaying 33 items.
- Finite complete rewriting systems and the complexity of word problem (Q791314) (← links)
- Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← links)
- A complete rewriting system for a monoid of tree transformation classes (Q918216) (← links)
- On deciding whether a monoid is a free monoid or is a group (Q1075439) (← links)
- Pseudo-natural algorithms for finitely generated presentations of monoids and groups (Q1115973) (← links)
- On the descriptive power of special Thue systems (Q1126309) (← links)
- Completing a finite special string-rewriting system on the congruence class of the empty word (Q1191634) (← links)
- Schematization of infinite sets of rewrite rules generated by divergent completion processes (Q1262755) (← links)
- Infinite string rewrite systems and complexity (Q1264463) (← links)
- Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids (Q1273769) (← links)
- Semigroups presented by one relation and satisfying the Church-Rosser property (Q1274007) (← links)
- Contributions of Ronald V. Book to the theory of string-rewriting systems (Q1274982) (← links)
- Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings (Q1275014) (← links)
- Computing presentations for subgroups of polycyclic groups and of context-free groups (Q1328439) (← links)
- A finiteness condition for rewriting systems (Q1331943) (← links)
- Codes modulo finite monadic string-rewriting systems (Q1341747) (← links)
- Constructing finitely presented monoids which have no finite complete presentation (Q1357103) (← links)
- Confluence of some presentations associated with graphs (Q1812584) (← links)
- On the descriptive power of term rewriting systems (Q1819932) (← links)
- On the rational subsets of the free group (Q1924996) (← links)
- Rewriting systems, plain groups, and geodetic graphs (Q2072071) (← links)
- Some applications of prefix-rewriting in monoids, groups, and rings (Q2702053) (← links)
- On McNaughton families of languages that are specified by some variants of monadic string-rewriting systems (Q2882391) (← links)
- Higher order indexed monadic systems (Q2911647) (← links)
- Growth functions for some one-relator monoids (Q3135703) (← links)
- GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM (Q3146308) (← links)
- Confluent string rewriting (Q3994922) (← links)
- Theorem proving with group presentations: Examples and questions (Q4647534) (← links)
- SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID (Q4786319) (← links)
- Monoid presentations of groups by finite special string-rewriting systems (Q4825397) (← links)
- Infinite Families of Finite String Rewriting Systems and Their Confluence (Q4933319) (← links)
- Space Complexity and Word Problems of Groups (Q5189807) (← links)
- ON GROUPS PRESENTED BY MONADIC REWRITING SYSTEMS WITH GENERATORS OF FINITE ORDER (Q5253345) (← links)
