Groups with context-free conjugacy problems.
From MaRDI portal
Publication:2996844
conjugacy problemcontext-free languagesvirtually cyclic groupshyperbolic groupsvirtually free groupsindexed languagesinverse conjugacy problem
Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Hyperbolic groups and nonpositively curved groups (20F67) Subgroup theorems; subgroup growth (20E07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40)
Recommendations
Cites work
Cited in
(10)- Context-Free Groups and Bass–Serre Theory
- Embeddings into Thompson's group \(V\) and \(\mathrm{co}\mathcal{C}{F}\) groups
- GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM
- Context-free pairs of groups. I: Context-free pairs and graphs
- Conjugacy languages in groups
- The generalized conjugacy problem for virtually free groups.
- Conjugacy languages in virtual graph products
- Conjugacy growth series and languages in groups.
- GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM
- Groups whose word problems are not semilinear
This page was built for publication: Groups with context-free conjugacy problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2996844)