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 5 items.
- The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages (Q840776) (← links)
- Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions. (Q1399980) (← 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)
