Composition Problems for Braids
From MaRDI portal
Publication:2963911
DOI10.4230/LIPIcs.FSTTCS.2013.175zbMath1359.68142OpenAlexW2244623270MaRDI QIDQ2963911
Publication date: 21 February 2017
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2013/4371/pdf/12.pdf
automatadecidabilitybraid groupmatrix semigroupscombinatorics on words\(\mathrm {NP}\)-hardnessgroup alphabet
Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (7)
Weighted Automata on Infinite Words in the Context of Attacker-Defender Games ⋮ The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete ⋮ Matrix Semigroup Freeness Problems in SL $$(2,\mathbb {Z})$$ ⋮ Vector Ambiguity and Freeness Problems in SL $$(2,\mathbb {Z})$$ ⋮ On the Identity Problem for the Special Linear Group and the Heisenberg Group. ⋮ Vector and scalar reachability problems in \(\operatorname{SL}(2, \mathbb{Z})\) ⋮ Weighted automata on infinite words in the context of attacker-defender games
This page was built for publication: Composition Problems for Braids
