leadWordAut GAP program
README file:
README for leadWordAut, GAP program for calculating the first and
second leading word automata as defined in the article "Automaton
Presentations of Noncommutative Invariant Rings" by Hans Ofverbeck.
Program written by Hans Ofverbeck 2004, Last modified 2004-11-12.
Program available from:
http://www.matematik.lu.se/matematiklu/personal/hans/gap/
This program requires GAP (tested with GAP 4.3 and 4.4) with the
"kbmag"-package installed. Kbmag is used for representing the
automata, so for a description of the format of the
automata which are returned, read the documentation for the
"kbmag"-package.
Usage: Start GAP, and then load the program file:
> Read("/path/to/leadWordAut.g");
To calculate the first/second leading word automaton
of some permutation group G:
> buildFirstLeadingFSA(G);
> buildSecondLeadingFSA(G);
To compare the number of states for the first, second and minimal
leading word automata for all transitive permutation groups of
order n (>= 2):
> testAlgs( n );
Note: to use this function the GAP-package "trans" must be
installed and loaded.
Warning: this function takes a long time to finish for
large (>=9) n.
Directory contents
| Name |
Size |
Description |
Last modified (GMT) |
| leadWordAut.tar.gz |
2,86 kB |
|
Fri Nov 12 15:13:18 2004 |
Hans
Öfverbeck
Last modified: Wed Nov 10 15:24:11 GMT 2004