Testing was broken with new automata pkg

.github/workflows/CI.yml

@@ -35,6 +35,7 @@ jobs:
       - uses: actions/checkout@v4
       - uses: gap-actions/setup-gap@v2
         with:
+          GAP_PKGS_TO_CLONE: "automata"
           GAPBRANCH: ${{ matrix.gap-branch }}
       - uses: gap-actions/build-pkg@v1
       - uses: gap-actions/run-pkg-tests@v2

README.md

@@ -4,13 +4,6 @@
 The 'PatternClass' GAP 4 package
 ================================
 
-!!!!!!!!!!!!!!
-! Patch info !
-!!!!!!!!!!!!!!
-We had to patch the IntersectionAutomaton, UnionAutomata and ProductLanguage
-from the Automata pkg (version 1.13) to improve performance testing. The
-patched functions are located in lib/automata.* .
-
 Introduction
 ------------
 

tst/AuxFun.tst

@@ -3,23 +3,19 @@
 #A  AuxFun.tst            PatternClass package                 Ruth Hoffmann
 ##
 gap> START_TEST("PatternClass");
-
 gap> LoadPackage("patternclass",false);
 true
 gap> SetAssertionLevel(1);
-
 gap> a1:=RationalExpression("(bUcUd)*ab*");
 (bUcUd)*ab*
 gap> a2:=RationalExpression("(acUd)*(aU@)");
 (acUd)*(aU@)
 gap> NDIntersectionAutomaton(a1,a2);
 Error, The arguments must be two automata over the same alphabet
-
 gap> a2:=RationalExpression("(acUd)*(aUb)");
 (acUd)*(aUb)
 gap> NDIntersectionAutomaton(a1,a2);
 < epsilon automaton on 5 letters with 9 states >
-
 gap> NDUnionAutomata(a1,a2);
 Error, The arguments must be two automata
 gap> a1:=RatExpToAut(RationalExpression("(bUcU@)*ab*"));
@@ -28,7 +24,6 @@ gap> a2:=RatExpToAut(RationalExpression("(acUd)*(@Ub)"));
 < deterministic automaton on 4 letters with 4 states >
 gap> NDUnionAutomata(a1,a2);
 Error, The arguments must be two automata over the same alphabet
-
 gap> a1:=RatExpToAut(RationalExpression("(bUcUdU@)*ab*"));
 < deterministic automaton on 4 letters with 3 states >
 gap> a2:=RatExpToAut(RationalExpression("(acUd)*(@Ub)"));
@@ -41,5 +36,4 @@ gap> a2:=RatExpToAut(RationalExpression("(acUd)*(@Ub)"));
 < deterministic automaton on 4 letters with 4 states >
 gap> NDUnionAutomata(a1,a2);
 Error, The arguments must be two automata over the same alphabet
-
 gap> STOP_TEST( "AuxFun.tst", 10000 );

tst/SubAut.tst

@@ -3,7 +3,6 @@
 #A  SubAut.tst            PatternClass package                 Ruth Hoffmann
 ##
 gap> START_TEST("PatternClass");
-
 gap> LoadPackage("patternclass",false);
 true
 gap> SetAssertionLevel(1);
@@ -16,11 +15,10 @@ gap> InbetweenPermAutomaton([1,2,3,4,5,6,7],[1,2,3]);
 gap> InbetweenPermAutomaton([5,4,3,2,1],[1]);
 < deterministic automaton on 5 letters with 7 states >
 gap> InbetweenPermSet([1,2,3,4,5,6,7],[1,2,3]);
-[ [ 1, 2, 3 ], [ 1, 2, 3, 4 ], [ 1, 2, 3, 4, 5 ], [ 1, 2, 3, 4, 5, 6 ],
+[ [ 1, 2, 3 ], [ 1, 2, 3, 4 ], [ 1, 2, 3, 4, 5 ], [ 1, 2, 3, 4, 5, 6 ], 
   [ 1, 2, 3, 4, 5, 6, 7 ] ]
 gap> IsSubPerm([1,2,3,4,5,6,7],[1,2,3]);
 true
 gap> IsSubPerm([1,2,3,4,7,6,5],[5,4,3,2,1]);
 false
-
 gap> STOP_TEST( "SubAut.tst", 10000 );

tst/chap10.tst

@@ -3,34 +3,31 @@
 #A  chap10.tst            PatternClass package                 Ruth Hoffmann
 ##
 gap> START_TEST("PatternClass");
-
 gap> LoadPackage("patternclass",false);
 true
 gap> SetAssertionLevel(1);
-
 gap> a:=Automaton("det",4,3,[[2,4,3,3],[4,4,1,4],[3,1,2,4]],[1],[2]);
 < deterministic automaton on 3 letters with 4 states >
 gap> b:=LoopFreeAut(a);
 < deterministic automaton on 3 letters with 5 states >
 gap> Display(b);
-   |  1  2  3  4  5
+   |  1  2  3  4  5  
 --------------------
- a |  2  4  5  3  5
- b |  4  4  1  5  5
- c |  3  1  2  5  5
+ a |  2  4  5  3  5  
+ b |  4  4  1  5  5  
+ c |  3  1  2  5  5  
 Initial state:   [ 1 ]
 Accepting state: [ 2 ]
 gap> a:=Automaton("det",4,3,[[2,4,3,3],[4,4,1,4],[3,1,2,4]],[1],[2]);
 < deterministic automaton on 3 letters with 4 states >
 gap> b:=LoopVertexFreeAut(a);
 < deterministic automaton on 3 letters with 3 states >
 gap> Display(b);
-   |  1  2  3
+   |  1  2  3  
 --------------
- a |  2  2  1
- b |  2  2  2
- c |  3  2  2
+ a |  2  2  1  
+ b |  2  2  2  
+ c |  3  2  2  
 Initial state:   [ 3 ]
 Accepting state: [ 1 ]
-
 gap> STOP_TEST( "chap10.tst", 10000 );

tst/chap2.tst

@@ -7,15 +7,15 @@ gap> LoadPackage("patternclass",false);
 true
 gap> SetAssertionLevel(1);
 gap> Parstacks(3,5);
-[ [ 2, 5 ], [ 3, 10 ], [ 2, 4 ], [ 3 ], [ 6, 10 ], [ 5, 7 ], [ 6, 8 ],
+[ [ 2, 5 ], [ 3, 10 ], [ 2, 4 ], [ 3 ], [ 6, 10 ], [ 5, 7 ], [ 6, 8 ], 
   [ 7, 9 ], [ 8 ], [  ] ]
 gap> Parstacks(3,5);
-[ [ 2, 5 ], [ 3, 10 ], [ 2, 4 ], [ 3 ], [ 6, 10 ], [ 5, 7 ], [ 6, 8 ],
+[ [ 2, 5 ], [ 3, 10 ], [ 2, 4 ], [ 3 ], [ 6, 10 ], [ 5, 7 ], [ 6, 8 ], 
   [ 7, 9 ], [ 8 ], [  ] ]
 gap> Seqstacks(3,4,3,3);
-[ [ 2 ], [ 3, 5 ], [ 2, 4 ], [ 3 ], [ 6, 9 ], [ 5, 7 ], [ 6, 8 ], [ 7 ],
+[ [ 2 ], [ 3, 5 ], [ 2, 4 ], [ 3 ], [ 6, 9 ], [ 5, 7 ], [ 6, 8 ], [ 7 ], 
   [ 10, 12 ], [ 9, 11 ], [ 10 ], [ 13, 15 ], [ 12, 14 ], [ 13 ], [  ] ]
 gap> BufferAndStack(4,4);
-[ [ 2 .. 5 ], [ 6 ], [ 6 ], [ 6 ], [ 6 ], [ 7, 10 ], [ 6, 8 ], [ 7, 9 ],
+[ [ 2 .. 5 ], [ 6 ], [ 6 ], [ 6 ], [ 6 ], [ 7, 10 ], [ 6, 8 ], [ 7, 9 ], 
   [ 8 ], [  ] ]
 gap> STOP_TEST( "chap2.tst", 10000 );

tst/chap4.tst

@@ -11,7 +11,7 @@ gap> a:=Seqstacks(3,3);
 gap> aut:=GraphToAut(a,1,8);
 < epsilon automaton on 6 letters with 680 states >
 gap> a:=Parstacks(5,5);
-[ [ 2, 7 ], [ 3, 12 ], [ 2, 4 ], [ 3, 5 ], [ 4, 6 ], [ 5 ], [ 8, 12 ],
+[ [ 2, 7 ], [ 3, 12 ], [ 2, 4 ], [ 3, 5 ], [ 4, 6 ], [ 5 ], [ 8, 12 ], 
   [ 7, 9 ], [ 8, 10 ], [ 9, 11 ], [ 10 ], [  ] ]
 gap> aut:=ConstrainedGraphToAut(a,1,12,5);
 < epsilon automaton on 12 letters with 5074 states >

tst/chap6.tst

@@ -7,45 +7,45 @@ gap> LoadPackage("patternclass",false);
 true
 gap> SetAssertionLevel(1);
 gap> trans:=Transducer(3,1,[[1,2,1,2],[1,2,2,2],[2,2,1,3],[2,2,2,3],[1,1,3,3],[2,2,3,3]],[2]);
-rec( accepting := [ 2 ], initial := 1, states := 3,
-  transitions := [ [ 1, 2, 1, 2 ], [ 1, 2, 2, 2 ], [ 2, 2, 1, 3 ],
+rec( accepting := [ 2 ], initial := 1, states := 3, 
+  transitions := [ [ 1, 2, 1, 2 ], [ 1, 2, 2, 2 ], [ 2, 2, 1, 3 ], 
       [ 2, 2, 2, 3 ], [ 1, 1, 3, 3 ], [ 2, 2, 3, 3 ] ] )
 gap> DeletionTransducer(5);
-rec( accepting := [ 1 .. 5 ], initial := 6, states := 6,
-  transitions := [ [ 1, 1, 6, 6 ], [ 1, 0, 6, 1 ], [ 2, 1, 1, 1 ],
-      [ 1, 1, 1, 2 ], [ 3, 2, 1, 1 ], [ 1, 1, 2, 3 ], [ 4, 3, 1, 1 ],
-      [ 1, 1, 3, 4 ], [ 5, 4, 1, 1 ], [ 1, 1, 4, 5 ], [ 1, 1, 5, 5 ],
-      [ 2, 2, 6, 6 ], [ 2, 0, 6, 2 ], [ 3, 2, 2, 2 ], [ 2, 2, 2, 3 ],
-      [ 4, 3, 2, 2 ], [ 2, 2, 3, 4 ], [ 5, 4, 2, 2 ], [ 2, 2, 4, 5 ],
-      [ 2, 2, 5, 5 ], [ 3, 3, 6, 6 ], [ 3, 0, 6, 3 ], [ 4, 3, 3, 3 ],
-      [ 3, 3, 3, 4 ], [ 5, 4, 3, 3 ], [ 3, 3, 4, 5 ], [ 3, 3, 5, 5 ],
-      [ 4, 4, 6, 6 ], [ 4, 0, 6, 4 ], [ 5, 4, 4, 4 ], [ 4, 4, 4, 5 ],
+rec( accepting := [ 1 .. 5 ], initial := 6, states := 6, 
+  transitions := [ [ 1, 1, 6, 6 ], [ 1, 0, 6, 1 ], [ 2, 1, 1, 1 ], 
+      [ 1, 1, 1, 2 ], [ 3, 2, 1, 1 ], [ 1, 1, 2, 3 ], [ 4, 3, 1, 1 ], 
+      [ 1, 1, 3, 4 ], [ 5, 4, 1, 1 ], [ 1, 1, 4, 5 ], [ 1, 1, 5, 5 ], 
+      [ 2, 2, 6, 6 ], [ 2, 0, 6, 2 ], [ 3, 2, 2, 2 ], [ 2, 2, 2, 3 ], 
+      [ 4, 3, 2, 2 ], [ 2, 2, 3, 4 ], [ 5, 4, 2, 2 ], [ 2, 2, 4, 5 ], 
+      [ 2, 2, 5, 5 ], [ 3, 3, 6, 6 ], [ 3, 0, 6, 3 ], [ 4, 3, 3, 3 ], 
+      [ 3, 3, 3, 4 ], [ 5, 4, 3, 3 ], [ 3, 3, 4, 5 ], [ 3, 3, 5, 5 ], 
+      [ 4, 4, 6, 6 ], [ 4, 0, 6, 4 ], [ 5, 4, 4, 4 ], [ 4, 4, 4, 5 ], 
       [ 4, 4, 5, 5 ], [ 5, 5, 6, 6 ], [ 5, 0, 6, 5 ], [ 5, 5, 5, 5 ] ] )
 gap> TransposedTransducer(last);
-rec( accepting := [ 1 .. 5 ], initial := 6, states := 6,
-  transitions := [ [ 1, 1, 6, 6 ], [ 0, 1, 6, 1 ], [ 1, 2, 1, 1 ],
-      [ 1, 1, 1, 2 ], [ 2, 3, 1, 1 ], [ 1, 1, 2, 3 ], [ 3, 4, 1, 1 ],
-      [ 1, 1, 3, 4 ], [ 4, 5, 1, 1 ], [ 1, 1, 4, 5 ], [ 1, 1, 5, 5 ],
-      [ 2, 2, 6, 6 ], [ 0, 2, 6, 2 ], [ 2, 3, 2, 2 ], [ 2, 2, 2, 3 ],
-      [ 3, 4, 2, 2 ], [ 2, 2, 3, 4 ], [ 4, 5, 2, 2 ], [ 2, 2, 4, 5 ],
-      [ 2, 2, 5, 5 ], [ 3, 3, 6, 6 ], [ 0, 3, 6, 3 ], [ 3, 4, 3, 3 ],
-      [ 3, 3, 3, 4 ], [ 4, 5, 3, 3 ], [ 3, 3, 4, 5 ], [ 3, 3, 5, 5 ],
-      [ 4, 4, 6, 6 ], [ 0, 4, 6, 4 ], [ 4, 5, 4, 4 ], [ 4, 4, 4, 5 ],
+rec( accepting := [ 1 .. 5 ], initial := 6, states := 6, 
+  transitions := [ [ 1, 1, 6, 6 ], [ 0, 1, 6, 1 ], [ 1, 2, 1, 1 ], 
+      [ 1, 1, 1, 2 ], [ 2, 3, 1, 1 ], [ 1, 1, 2, 3 ], [ 3, 4, 1, 1 ], 
+      [ 1, 1, 3, 4 ], [ 4, 5, 1, 1 ], [ 1, 1, 4, 5 ], [ 1, 1, 5, 5 ], 
+      [ 2, 2, 6, 6 ], [ 0, 2, 6, 2 ], [ 2, 3, 2, 2 ], [ 2, 2, 2, 3 ], 
+      [ 3, 4, 2, 2 ], [ 2, 2, 3, 4 ], [ 4, 5, 2, 2 ], [ 2, 2, 4, 5 ], 
+      [ 2, 2, 5, 5 ], [ 3, 3, 6, 6 ], [ 0, 3, 6, 3 ], [ 3, 4, 3, 3 ], 
+      [ 3, 3, 3, 4 ], [ 4, 5, 3, 3 ], [ 3, 3, 4, 5 ], [ 3, 3, 5, 5 ], 
+      [ 4, 4, 6, 6 ], [ 0, 4, 6, 4 ], [ 4, 5, 4, 4 ], [ 4, 4, 4, 5 ], 
       [ 4, 4, 5, 5 ], [ 5, 5, 6, 6 ], [ 0, 5, 6, 5 ], [ 5, 5, 5, 5 ] ] )
 gap> InvolvementTransducer(3);
-rec( accepting := [ 1 .. 4 ], initial := 4, states := 4,
-  transitions := [ [ 1, 1, 1, 2 ], [ 1, 0, 1, 3 ], [ 2, 1, 1, 1 ],
-      [ 2, 0, 1, 3 ], [ 3, 2, 1, 1 ], [ 3, 0, 1, 1 ], [ 1, 1, 2, 4 ],
-      [ 1, 0, 2, 1 ], [ 2, 2, 2, 4 ], [ 2, 0, 2, 2 ], [ 3, 2, 2, 2 ],
-      [ 3, 0, 2, 2 ], [ 1, 1, 3, 2 ], [ 1, 0, 3, 3 ], [ 2, 1, 3, 1 ],
-      [ 2, 0, 3, 3 ], [ 3, 1, 3, 3 ], [ 3, 0, 3, 3 ], [ 1, 1, 4, 4 ],
-      [ 1, 0, 4, 1 ], [ 2, 2, 4, 4 ], [ 2, 0, 4, 2 ], [ 3, 3, 4, 4 ],
+rec( accepting := [ 1 .. 4 ], initial := 4, states := 4, 
+  transitions := [ [ 1, 1, 1, 2 ], [ 1, 0, 1, 3 ], [ 2, 1, 1, 1 ], 
+      [ 2, 0, 1, 3 ], [ 3, 2, 1, 1 ], [ 3, 0, 1, 1 ], [ 1, 1, 2, 4 ], 
+      [ 1, 0, 2, 1 ], [ 2, 2, 2, 4 ], [ 2, 0, 2, 2 ], [ 3, 2, 2, 2 ], 
+      [ 3, 0, 2, 2 ], [ 1, 1, 3, 2 ], [ 1, 0, 3, 3 ], [ 2, 1, 3, 1 ], 
+      [ 2, 0, 3, 3 ], [ 3, 1, 3, 3 ], [ 3, 0, 3, 3 ], [ 1, 1, 4, 4 ], 
+      [ 1, 0, 4, 1 ], [ 2, 2, 4, 4 ], [ 2, 0, 4, 2 ], [ 3, 3, 4, 4 ], 
       [ 3, 0, 4, 4 ] ] )
 gap> a:=Automaton("det",1,1,[[1]],[1],[1]);
 < deterministic automaton on 1 letters with 1 states >
 gap> t:=Transducer(2,1,[[1,2,1,2],[2,1,1,2],[1,1,2,1],[2,2,2,1]],[1]);
-rec( accepting := [ 1 ], initial := 1, states := 2,
-  transitions := [ [ 1, 2, 1, 2 ], [ 2, 1, 1, 2 ], [ 1, 1, 2, 1 ],
+rec( accepting := [ 1 ], initial := 1, states := 2, 
+  transitions := [ [ 1, 2, 1, 2 ], [ 2, 1, 1, 2 ], [ 1, 1, 2, 1 ], 
       [ 2, 2, 2, 1 ] ] )
 gap> res:=CombineAutTransducer(a,t);
 < non deterministic automaton on 2 letters with 2 states >
@@ -88,12 +88,12 @@ gap> aut:=Automaton("det",3,2,[[2,2,3],[3,3,3]],[1],[3]);
 gap> ExpandAlphabet(aut,4);
 < deterministic automaton on 4 letters with 3 states >
 gap> Display(last);
-   |  1  2  3
+   |  1  2  3  
 --------------
- a |  2  2  3
- b |  3  3  3
- c |
- d |
+ a |  2  2  3  
+ b |  3  3  3  
+ c |           
+ d |           
 Initial state:   [ 1 ]
 Accepting state: [ 3 ]
 gap> ClassDirectSum(BoundedClassAutomaton(4),BoundedClassAutomaton(3));
@@ -103,28 +103,28 @@ gap> ClassDirectSum(BoundedClassAutomaton(3),BoundedClassAutomaton(6));
 gap> a:=BoundedClassAutomaton(5);
 < deterministic automaton on 5 letters with 5 states >
 gap> Spectrum(a);
-[ 1, 2, 6, 24, 120, 600, 3000, 15000, 75000, 375000, 1875000, 9375000,
+[ 1, 2, 6, 24, 120, 600, 3000, 15000, 75000, 375000, 1875000, 9375000, 
   46875000, 234375000, 1171875000 ]
 gap> Spectrum(a,10);
 [ 1, 2, 6, 24, 120, 600, 3000, 15000, 75000, 375000 ]
 gap> NumberAcceptedWords(a,10);
 375000
 gap> AutStateTransitionMatrix(a);
-[ [ 1, 1, 1, 1, 1 ], [ 1, 1, 1, 1, 1 ], [ 0, 2, 1, 1, 1 ], [ 0, 0, 3, 1, 1 ],
+[ [ 1, 1, 1, 1, 1 ], [ 1, 1, 1, 1, 1 ], [ 0, 2, 1, 1, 1 ], [ 0, 0, 3, 1, 1 ], 
   [ 0, 0, 0, 4, 1 ] ]
 gap> AcceptedWords(a,4);
-[ [ 1, 1, 1, 1 ], [ 1, 1, 2, 1 ], [ 1, 2, 1, 1 ], [ 1, 2, 2, 1 ],
-  [ 1, 3, 1, 1 ], [ 1, 3, 2, 1 ], [ 2, 1, 1, 1 ], [ 2, 1, 2, 1 ],
-  [ 2, 2, 1, 1 ], [ 2, 2, 2, 1 ], [ 2, 3, 1, 1 ], [ 2, 3, 2, 1 ],
-  [ 3, 1, 1, 1 ], [ 3, 1, 2, 1 ], [ 3, 2, 1, 1 ], [ 3, 2, 2, 1 ],
-  [ 3, 3, 1, 1 ], [ 3, 3, 2, 1 ], [ 4, 1, 1, 1 ], [ 4, 1, 2, 1 ],
+[ [ 1, 1, 1, 1 ], [ 1, 1, 2, 1 ], [ 1, 2, 1, 1 ], [ 1, 2, 2, 1 ], 
+  [ 1, 3, 1, 1 ], [ 1, 3, 2, 1 ], [ 2, 1, 1, 1 ], [ 2, 1, 2, 1 ], 
+  [ 2, 2, 1, 1 ], [ 2, 2, 2, 1 ], [ 2, 3, 1, 1 ], [ 2, 3, 2, 1 ], 
+  [ 3, 1, 1, 1 ], [ 3, 1, 2, 1 ], [ 3, 2, 1, 1 ], [ 3, 2, 2, 1 ], 
+  [ 3, 3, 1, 1 ], [ 3, 3, 2, 1 ], [ 4, 1, 1, 1 ], [ 4, 1, 2, 1 ], 
   [ 4, 2, 1, 1 ], [ 4, 2, 2, 1 ], [ 4, 3, 1, 1 ], [ 4, 3, 2, 1 ] ]
 gap> AcceptedWordsR(a,4);
-[ [ 1, 1, 1, 1 ], [ 1, 2, 1, 1 ], [ 1, 1, 2, 1 ], [ 1, 2, 2, 1 ],
-  [ 1, 1, 3, 1 ], [ 1, 2, 3, 1 ], [ 1, 1, 1, 2 ], [ 1, 2, 1, 2 ],
-  [ 1, 1, 2, 2 ], [ 1, 2, 2, 2 ], [ 1, 1, 3, 2 ], [ 1, 2, 3, 2 ],
-  [ 1, 1, 1, 3 ], [ 1, 2, 1, 3 ], [ 1, 1, 2, 3 ], [ 1, 2, 2, 3 ],
-  [ 1, 1, 3, 3 ], [ 1, 2, 3, 3 ], [ 1, 1, 1, 4 ], [ 1, 2, 1, 4 ],
+[ [ 1, 1, 1, 1 ], [ 1, 2, 1, 1 ], [ 1, 1, 2, 1 ], [ 1, 2, 2, 1 ], 
+  [ 1, 1, 3, 1 ], [ 1, 2, 3, 1 ], [ 1, 1, 1, 2 ], [ 1, 2, 1, 2 ], 
+  [ 1, 1, 2, 2 ], [ 1, 2, 2, 2 ], [ 1, 1, 3, 2 ], [ 1, 2, 3, 2 ], 
+  [ 1, 1, 1, 3 ], [ 1, 2, 1, 3 ], [ 1, 1, 2, 3 ], [ 1, 2, 2, 3 ], 
+  [ 1, 1, 3, 3 ], [ 1, 2, 3, 3 ], [ 1, 1, 1, 4 ], [ 1, 2, 1, 4 ], 
   [ 1, 1, 2, 4 ], [ 1, 2, 2, 4 ], [ 1, 1, 3, 4 ], [ 1, 2, 3, 4 ] ]
 gap> a:=BoundedClassAutomaton(5);
 < deterministic automaton on 5 letters with 5 states >

tst/chap8.tst

@@ -3,16 +3,13 @@
 #A  chap8.tst            PatternClass package                 Ruth Hoffmann
 ##
 gap> START_TEST("PatternClass");
-
 gap> LoadPackage("patternclass",false);
 true
 gap> SetAssertionLevel(1);
-
 gap> IsInterval([3,6,9,2]);
 false
 gap> IsInterval([2,6,5,3,4]);
 true
-
 gap> IsSimplePerm([2,3,4,5,1,1,1,1]);
 true
 gap> IsSimplePerm([2,4,6,8,1,3,5,7]);
@@ -21,16 +18,17 @@ gap> IsSimplePerm([3,2,8,6,7,1,5,4]);
 false
 gap> IsSimplePerm([1,1,1,1]);
 false
-
 gap> OnePointDelete([5,2,3,1,2,1]);
 [ [ 2, 3, 1, 2, 1 ], [ 4, 1, 2, 2, 1 ] ]
 gap> OnePointDelete([5,2,4,1,6,3]);
 [ [ 2, 3, 1, 2, 1 ], [ 4, 1, 2, 2, 1 ] ]
 gap> OnePointDelete([2,4,6,8,1,3,5,7]);
-[ 2, 4, 6, 8, 1, 3, 5, 7
- ]is an exceptional permutation and needs 2 point deletion.fail
+[ 2, 4, 6, 8, 1, 3, 5, 7 
+ ] is an exceptional permutation and needs 2 point deletion.
+fail
 gap> OnePointDelete([1,2,4,6,8,3,5,7]);
-[ 1, 2, 4, 6, 8, 3, 5, 7 ]is not simple.fail
+[ 1, 2, 4, 6, 8, 3, 5, 7 ] is not simple.
+fail
 gap> TwoPointDelete([2,4,6,8,1,3,5,7]);
 [ [ 2, 3, 4, 1, 1, 1 ] ]
 gap> TwoPointDelete([2,3,4,5,1,1,1,1]);
@@ -53,8 +51,8 @@ gap> PointDeletion([2,4,6,8,1,3,5,7]);
 gap> PointDeletion([2,3,4,5,1,1,1,1]);
 [ [ 2, 3, 4, 1, 1, 1 ] ]
 gap> PointDeletion([1,2,3,4,5]);
-[ 1, 2, 3, 4, 5 ]is not simple.fail
-
+[ 1, 2, 3, 4, 5 ] is not simple.
+fail
 gap> Inflation([[3,2,1],[1],[1,2],[1,2,3]]);
 [ 6, 4, 5, 1, 2, 3 ]
 gap> Inflation([[1,2],[1],[4,2,1,3]]);
@@ -67,14 +65,12 @@ gap> BlockDecomposition([1,2,3,4,5]);
 [ [ 1, 2 ], [ 1, 2, 3, 4 ], [ 1 ] ]
 gap> BlockDecomposition([5,4,3,2,1]);
 [ [ 2, 1 ], [ 4, 3, 2, 1 ], [ 1 ] ]
-
 gap> IsPlusDecomposable([3,3,2,3,2,2,1,1]);
 true
 gap> IsPlusDecomposable([3,2,8,6,7,1,5,4]);
 false
 gap> IsPlusDecomposable([3,4,2,6,5,7,1,8]);
 true
-
 gap> IsMinusDecomposable([3,3,3,3,3,3,2,1]);
 true
 gap> IsMinusDecomposable([3,4,5,6,7,8,2,1]);
@@ -83,7 +79,6 @@ gap> IsMinusDecomposable([3,2,8,6,7,1,5,4]);
 false
 gap> IsMinusDecomposable([1,2,6,5,4,3]);
 false
-
 gap> PermDirectSum([2,4,1,3],[2,5,4,1,3]);
 [ 2, 4, 1, 3, 6, 9, 8, 5, 7 ]
 gap> PermDirectSum([2,3,1,1],[2,4,3,1,1]);
@@ -92,6 +87,4 @@ gap> PermSkewSum([2,4,1,3],[2,5,4,1,3]);
 [ 7, 9, 6, 8, 2, 5, 4, 1, 3 ]
 gap> PermSkewSum([2,3,1,1],[2,4,3,1,1]);
 [ 7, 8, 6, 6, 2, 4, 3, 1, 1 ]
-
-
 gap> STOP_TEST( "chap8.tst", 10000 );