Pages that link to "Item:Q1273769"
From MaRDI portal
The following pages link to Infinite convergent string-rewriting systems and cross-sections for finitely presented monoids (Q1273769):
Displaying 13 items.
- Hyperbolicity of monoids presented by confluent monadic rewriting systems. (Q375928) (← links)
- A finitely presented monoid which has solvable word problem but has no regular complete presentation (Q673144) (← links)
- The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages (Q840776) (← links)
- On deciding the confluence of a finite string-rewriting system on a given congruence class (Q1102946) (← links)
- Infinite string rewrite systems and complexity (Q1264463) (← links)
- Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions. (Q1399980) (← links)
- Some results on Green's relations for monoids presented by monadic string-rewriting systems (Q1849636) (← links)
- Finitely presented monoids with linear Dehn function need not have regular cross-sections. (Q2247984) (← links)
- Markov semigroups, monoids and groups. (Q2923337) (← links)
- Polygraphs of finite derivation type (Q3130298) (← links)
- (Q4255520) (← links)
- Infinite Families of Finite String Rewriting Systems and Their Confluence (Q4933319) (← links)
- Rational cross-sections, bounded generation, and orders on groups (Q6561003) (← links)
