Pages that link to "Item:Q910850"

The following pages link to About the descriptive power of certain classes of finite string-rewriting systems (Q910850):

Displaying 14 items.

• Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← 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)
• Semigroups presented by one relation and satisfying the Church-Rosser property (Q1274007) (← 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)
• Confluence of some presentations associated with graphs (Q1812584) (← links)
• On the rational subsets of the free group (Q1924996) (← links)
• Rewriting systems, plain groups, and geodetic graphs (Q2072071) (← links)
• Growth functions for some one-relator monoids (Q3135703) (← links)
• GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM (Q3146308) (← links)
• Monoid presentations of groups by finite special string-rewriting systems (Q4825397) (← links)