Groups with context-free conjugacy problems.
DOI10.1142/S0218196711006133zbMATH Open1236.20038MaRDI QIDQ2996844FDOQ2996844
Authors: Derek F. Holt, Sarah Rees, Claas E. Röver
Publication date: 3 May 2011
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Recommendations
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)
Cites Work
Cited In (10)
- 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
- Context-Free Groups and Bass–Serre Theory
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)