Context-free pairs of groups I: Context-free pairs and graphs

Details Context-free pairs of groups I: Context-free pairs and graphs Context-free pairs of groups I: Context-free pairs and graphs

2009-10-31

arxiv.org/abs/0911.0090v1

Mathematics

Group Theory

Scientific paper

Let $G$ be a finitely generated group, $A$ a finite set of generators and $K$ a subgroup of $G$. We call the pair $(G,K)$ context-free if the set of all words over $A$ that reduce in $G$ to an element of $K$ is a context-free language. When $K$ is trivial, $G$ itself is called context-free; context-free groups have been classified more than 20 years ago in celebrated work of Muller and Schupp as the virtually free groups. Here, we derive some basic properties of such group pairs. Context-freeness is independent of the choice of the generating set. It is preserved under finite index modifications of $G$ and finite index enlargements of $K$. If $G$ is virtually free and $K$ is finitely generated then $(G,K)$ is context-free. A basic tool is the following: $(G,K)$ is context-free if and only if the Schreier graph of $(G,K)$ with respect to $A$ is a context-free graph.

Affiliated with

Also associated with

No associations

Rating

Context-free pairs of groups I: Context-free pairs and graphs 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-free pairs of groups I: Context-free pairs and graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Context-free pairs of groups I: Context-free pairs and graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-150138