GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM

DOI10.1112/S002461070500654XzbMath1104.20033OpenAlexW2020692304MaRDI 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)

Full work available at URL: https://doi.org/10.1112/s002461070500654x

zbMATH Keywords

word problempolycyclic groupsBaumslag-Solitar groupsvirtually Abelian groupscontext-free groupsco-word problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40)

Related Items (28)

The (nested) word problem ⋮ The co-word problem for the Higman-Thompson group is context-free ⋮ Some embeddings between symmetric R. thompson groups ⋮ GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM ⋮ Finitely Generated Soluble Groups and Their Subgroups ⋮ On the rational subset problem for groups. ⋮ \(\mathcal C\)-graph automatic groups. ⋮ Groups whose word problems are accepted by abelian \(G\)-automata ⋮ Normalish Amenable Subgroups of the R. Thompson Groups ⋮ Context-free pairs of groups. I: Context-free pairs and graphs ⋮ Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups ⋮ A language hierarchy of binary relations ⋮ Rational embeddings of hyperbolic groups ⋮ Multipass automata and group word problems ⋮ The submonoid and rational subset membership problems for graph groups. ⋮ The loop problem for Rees matrix semigroups. ⋮ CONTEXT-FREE GROUPS AND THEIR STRUCTURE TREES ⋮ ON GROUPS AND COUNTER AUTOMATA ⋮ A dynamical definition of f.g. virtually free groups ⋮ Real computational universality: the word problem for a class of groups with infinite presentation ⋮ Embeddings into Thompson's group V and coCF groups ⋮ THE IDEMPOTENT PROBLEM FOR AN INVERSE MONOID ⋮ Groups Whose Word Problem is a Petri Net Language ⋮ Anisimov's Theorem for inverse semigroups ⋮ Free products in R. Thompson’s group 𝑉 ⋮ GROUPS WITH INDEXED CO-WORD PROBLEM ⋮ Non-finitely generated maximal subgroups of context-free monoids ⋮ Regular left-orders on groups

This page was built for publication: GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM