GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM
From MaRDI portal
Publication:5465986
DOI10.1112/S002461070500654XzbMath1104.20033MaRDI QIDQ5465986
Derek F. Holt, Sarah Rees, Richard M. Thomas, Claas E. Röver
Publication date: 23 August 2005
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
word problem; polycyclic groups; Baumslag-Solitar groups; virtually Abelian groups; context-free groups; co-word problem
68Q45: Formal languages and automata
20F05: Generators, relations, and presentations of groups
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
03D40: Word problems, etc. in computability and recursion theory
Related Items
CONTEXT-FREE GROUPS AND THEIR STRUCTURE TREES, Some embeddings between symmetric R. thompson groups, Anisimov's Theorem for inverse semigroups, The co-word problem for the Higman-Thompson group is context-free, GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM, Finitely Generated Soluble Groups and Their Subgroups, Groups Whose Word Problem is a Petri Net Language, \(\mathcal C\)-graph automatic groups., Context-free pairs of groups. I: Context-free pairs and graphs, Multipass automata and group word problems, Real computational universality: the word problem for a class of groups with infinite presentation, On the rational subset problem for groups., The submonoid and rational subset membership problems for graph groups., A language hierarchy of binary relations, Rational embeddings of hyperbolic groups, The loop problem for Rees matrix semigroups., The (nested) word problem, A dynamical definition of f.g. virtually free groups, Embeddings into Thompson's group V and coCF groups, Free products in R. Thompson’s group 𝑉, Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups, THE IDEMPOTENT PROBLEM FOR AN INVERSE MONOID, GROUPS WITH INDEXED CO-WORD PROBLEM, ON GROUPS AND COUNTER AUTOMATA