Context-Freeness of Higman-Thompson group's co-word problem

Details Context-Freeness of Higman-Thompson group's co-word problem Context-Freeness of Higman-Thompson group's co-word problem

2005-07-05

arxiv.org/abs/math/0507090v1

Mathematics

Group Theory

9 pages

Scientific paper

The co-word problem of a group G generated by a set X is defined as the set of words in X which do not represent 1 in G. We introduce a new method to decide if a permutation group has context-free co-word problem. We use this method to show, that the Higman-Thompson groups, and therefore the Houghton groups, have context-free co-word problem. We also give some examples of groups, that even have an easier co-word problem. We call this property semi-deterministic context-free. The second Houghton group belongs to this class.

Affiliated with

Also associated with

No associations

Rating

Context-Freeness of Higman-Thompson group's co-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 Context-Freeness of Higman-Thompson group's co-word problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Context-Freeness of Higman-Thompson group's co-word problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-59407