Groups with poly-context-free word problem

Details Groups with poly-context-free word problem Groups with poly-context-free word problem

2011-04-10

arxiv.org/abs/1104.1806v1

Mathematics

Group Theory

38 pages, no figures

Scientific paper

We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free groups has poly-context-free word problem, and conjecture that the converse also holds. We prove our conjecture for several classes of soluble groups, including metabelian groups and torsion-free soluble groups, and present progress towards resolving the conjecture for soluble groups in general. Some of the techniques introduced for proving languages not to be poly-context-free may be of independent interest.

Affiliated with

Also associated with

No associations

Rating

Groups with poly-context-free word problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Groups with poly-context-free word problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Groups with poly-context-free word problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-57915