Pages that link to "Item:Q5462671"
From MaRDI portal
The following pages link to DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS (Q5462671):
Displaying 14 items.
- Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids. (Q479731) (← links)
- Cayley graphs as classifiers for data mining: the influence of asymmetries (Q1044901) (← links)
- Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types \(A_{n}\), \(B_{n}\), \(C_{n}\), \(D_{n}\), and \(G_{2}\) (Q1633382) (← links)
- Compression techniques in group theory (Q2117795) (← links)
- Uniform decision problems for automatic semigroups. (Q2509285) (← links)
- Inverse monoids: decidability and complexity of algebraic questions. (Q2643082) (← links)
- (Q5092405) (← links)
- LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE (Q5483463) (← links)
- Complexity of word problems for HNN-extensions (Q5918684) (← links)
- Knapsack in hyperbolic groups (Q5919299) (← links)
- Logspace computations in graph products (Q5925209) (← links)
- Complexity of word problems for HNN-extensions (Q5925702) (← links)
- Parallel algorithms for power circuits and the word problem of the Baumslag group (Q6083216) (← links)
- The power word problem in graph products (Q6580077) (← links)
