The power word problem in graph products

DOI10.1007/978-3-031-05578-2_23OpenAlexW4285253881MaRDI QIDQ2164009

Florian Stober, Armin Weiß

Publication date: 11 August 2022

Full work available at URL: https://arxiv.org/abs/2201.06543

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Knapsack and the power word problem in solvable Baumslag–Solitar groups

Cites Work

• Unnamed Item
• Unnamed Item
• On some equations in free partially commutative monoids
• The word problem for free partially commutative groups
• Knapsack in graph groups
• Logspace Computations in Coxeter Groups and Graph Groups
• Efficient Computation in Groups Via Compression
• The conjugacy problem in subgroups of right-angled Artin groups
• Word Problems Solvable in Logspace
• COMPRESSED DECISION PROBLEMS FOR GRAPH PRODUCTS AND APPLICATIONS TO (OUTER) AUTOMORPHISM GROUPS
• Uniqueness Theorems for Periodic Functions
• The Compressed Word Problem for Groups
• Knapsack problems in groups

This page was built for publication: The power word problem in graph products