example of Munn tree
Let X={a,b,c}, w=aaa-1a-1a-1abb-1ab-1bcaa-1cc-1. The reduced prefix set of w is
red(pref(w))={ε,a,aa,a-1,b,ab-1,ac,aca,acc}. |
The Munn tree MT(w) is the following.
\xymatrix&b&ab-1\ar[d]b&a-1\ar[r]a&ε\ar[u]b\ar[r]a&a\ar[d]c\ar[r]a&aa&&ac\ar[r]c\ar[d]a&acc&&aca& |
Note that we have drawn only edges of the form (v1,x,v2) (i.e. \xymatrixv1\ar[r]x&v2) with x∈X, leaving implicit the existence of the opposite edges (v2,x-1,v1) (i.e. \xymatrixv2\ar[r]x-1&v1), as usual in the diagram representation of inverse
word graphs.
Title | example of Munn tree |
---|---|
Canonical name | ExampleOfMunnTree |
Date of creation | 2013-03-22 16:12:02 |
Last modified on | 2013-03-22 16:12:02 |
Owner | Mazzu (14365) |
Last modified by | Mazzu (14365) |
Numerical id | 20 |
Author | Mazzu (14365) |
Entry type | Example |
Classification | msc 20M05 |
Classification | msc 20M18 |