Pages that link to "Item:Q578921"
From MaRDI portal
The following pages link to On the complexity of some extended word problems defined by cancellation rules (Q578921):
Displaying 8 items.
- Bottom-up rewriting for words and terms (Q741256) (← links)
- Some decision problems about controlled rewriting systems (Q910246) (← links)
- On the security of p-party protocols (Q1102922) (← links)
- The word problem of inverse monoids presented by one idempotent relator (Q1314383) (← links)
- The finite power property in free groups (Q1870586) (← links)
- An automata theoretic approach to the generalized word problem in graphs of groups (Q5189169) (← links)
- Rational cross-sections, bounded generation, and orders on groups (Q6561003) (← links)
- Subgroup membership in \(\mathrm{GL}(2, \mathrm{Z})\) (Q6614621) (← links)
