Update website for PatternClass 2.4.4

PackageInfo.g

@@ -10,8 +10,8 @@ SetPackageInfo( rec(
 
 PackageName := "PatternClass",
 Subtitle := "A permutation pattern class package",
-Version := "2.4.3",
-Date := "17/10/2022", # dd/mm/yyyy format
+Version := "2.4.4",
+Date := "28/08/2024", # dd/mm/yyyy format
 License := "GPL-2.0-or-later",
 
 Persons := [

README.md

@@ -14,7 +14,7 @@ patched functions are located in lib/automata.* .
 Introduction
 ------------
 
-This is version 2.4.2 of the 'PatternClass' package.
+This is version 2.4.4 of the 'PatternClass' package.
 
 The 'PatternClass' package allows you to explore the permutation
 pattern classes build by token passing networks.
@@ -89,6 +89,12 @@ online or within GAP help.
 
 Changes
 -------
+
+
+Changes from 2.4.4 to 2.4.2:
+- Update CI, and use latest GAP functionality.
+<<<>>><<<>>><<<>>><<<>>>
+
 Changes from 2.4 to 2.4.2:
 - Changed the name of HashSet due to clash with DataStructure Package
 - Removed TODOs from code

_data/package.yml

@@ -1,6 +1,6 @@
 name: PatternClass
-version: 2.4.3
-date: 2022-10-17
+version: 2.4.4
+date: 2024-08-28
 description: |
     A permutation pattern class package
 
@@ -24,15 +24,15 @@ needed-pkgs:
       url: "https://gap-packages.github.io/automata/"
     - name: "GAPDoc"
       version: ">= 1.5"
-      url: "http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc"
+      url: "https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc"
 
 www: https://gap-packages.github.io/PatternClass/
 readme: README.md
 packageinfo: https://gap-packages.github.io/PatternClass/PackageInfo.g
 
 downloads:
     - name: .tar.gz
-      url: https://github.com/gap-packages/PatternClass/releases/download/v2.4.3/PatternClass-2.4.3.tar.gz
+      url: https://github.com/gap-packages/PatternClass/releases/download/v2.4.4/PatternClass-2.4.4.tar.gz
 
 abstract: |
     The PatternClass package is build on the idea of token passing networks building permutation pattern classes. Those classes are best determined by their basis. Both sets can be encoded by rank encoding their permutations. Each, the class and its basis, in their encoded form build a rational language. Rational languages can be easily computed by using automata, which also can be build directly from the token passing networks. Both ways will build the same language, i.e. the same automaton.

doc/chap0.html

@@ -29,10 +29,10 @@ <h1>PatternClass</h1>
 <h2>A permutation pattern class package</h2>
 
 <p>
-    2.3</p>
+    2.4.4</p>
 
 <p>
-    05/07/2017
+    28 August 2024
   </p>
 
 </div>
@@ -45,7 +45,7 @@ <h2>A permutation pattern class package</h2>
   </b>
 <br />Email: <span class="URL"><a href="mailto:[email protected]">[email protected]</a></span>
 <br />Homepage: <span class="URL"><a href="https://rh347.host.cs.st-andrews.ac.uk/">https://rh347.host.cs.st-andrews.ac.uk/</a></span>
-<br />Address: <br />Ruth Hoffmann<br /> School of Computer Science,<br /> University of St. Andrews,<br /> North Haugh,<br /> St. Andrews,<br /> Fife,<br /> KY16 9SS,<br /> SCOTLAND<br />
+<br />Address: <br />School of Computer Science,<br /> University of St. Andrews,<br /> North Haugh,<br /> St. Andrews,<br /> Fife,<br /> KY16 9SS,<br /> SCOTLAND<br />
 </p><p><b>
     Steve Linton
 
@@ -64,7 +64,7 @@ <h2>A permutation pattern class package</h2>
 
   </b>
 <br />Email: <span class="URL"><a href="mailto:[email protected]">[email protected]</a></span>
-<br />Homepage: <span class="URL"><a href="http://www.cs.otago.ac.nz/staff/michael.html">http://www.cs.otago.ac.nz/staff/michael.html</a></span>
+<br />Homepage: <span class="URL"><a href="https://www.otago.ac.nz/computer-science/people/Michael_Albert.html">https://www.otago.ac.nz/computer-science/people/Michael_Albert.html</a></span>
 <br />Address: <br />Michael Albert<br /> Department of Computer Science,<br /> University of Otago,<br /> PO Box 56,<br /> DUNEDIN 9054,<br /> New Zealand,<br />
 </p>
 
@@ -252,19 +252,17 @@ <h3>Contents<a id="contents" name="contents"></a></h3>
 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap10.html#X8503A7707FA666C4">10.2-2 LoopVertexFreeAut</a></span>
 </div></div>
 </div>
-<div class="ContChap"><a href="chapInd.html"><span class="Heading">Index</span></a></div>
 <div class="ContChap"><a href="chapBib.html"><span class="Heading">References</span></a></div>
+<div class="ContChap"><a href="chapInd.html"><span class="Heading">Index</span></a></div>
 <br />
 </div>
-<p> </p>
-
 
 <div class="chlinkprevnextbot">&nbsp;<a href="chap0.html">[Top of Book]</a>&nbsp;  <a href="chap0.html#contents">[Contents]</a>&nbsp;  &nbsp;<a href="chap1.html">[Next Chapter]</a>&nbsp;  </div>
 
 
 <div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><a href="chap0.html">Top</a>  <a href="chap1.html">1</a>  <a href="chap2.html">2</a>  <a href="chap3.html">3</a>  <a href="chap4.html">4</a>  <a href="chap5.html">5</a>  <a href="chap6.html">6</a>  <a href="chap7.html">7</a>  <a href="chap8.html">8</a>  <a href="chap9.html">9</a>  <a href="chap10.html">10</a>  <a href="chapBib.html">Bib</a>  <a href="chapInd.html">Ind</a>  </div>
 
 <hr />
-<p class="foot">generated by <a href="http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
+<p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
 </body>
 </html>

doc/chap0.txt

@@ -6,10 +6,10 @@
                       A permutation pattern class package 
 
 
-                                      2.3
+                                     2.4.4
 
 
-                                   05/07/2017
+                                 28 August 2024
 
 
                                  Ruth Hoffmann
@@ -23,8 +23,7 @@
   Ruth Hoffmann
       Email:    mailto:[email protected]
       Homepage: https://rh347.host.cs.st-andrews.ac.uk/
-      Address:  Ruth Hoffmann
-                School of Computer Science,
+      Address:  School of Computer Science,
                 University of St. Andrews,
                 North Haugh,
                 St. Andrews,
@@ -48,7 +47,7 @@
 
   Michael Albert
       Email:    mailto:[email protected]
-      Homepage: http://www.cs.otago.ac.nz/staff/michael.html
+      Homepage: https://www.otago.ac.nz/computer-science/people/Michael_Albert.html
       Address:  Michael Albert
                 Department of Computer Science,
                 University of Otago,
@@ -163,5 +162,3 @@
 
 
   
-   
-

doc/chap0_mj.html

@@ -6,7 +6,7 @@
 <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
 <head>
 <script type="text/javascript"
-  src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.0/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
+  src="https://cdn.jsdelivr.net/npm/mathjax@2/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
 </script>
 <title>GAP (PatternClass) - Contents</title>
 <meta http-equiv="content-type" content="text/html; charset=UTF-8" />
@@ -32,10 +32,10 @@ <h1>PatternClass</h1>
 <h2>A permutation pattern class package</h2>
 
 <p>
-    2.3</p>
+    2.4.4</p>
 
 <p>
-    05/07/2017
+    28 August 2024
   </p>
 
 </div>
@@ -48,7 +48,7 @@ <h2>A permutation pattern class package</h2>
   </b>
 <br />Email: <span class="URL"><a href="mailto:[email protected]">[email protected]</a></span>
 <br />Homepage: <span class="URL"><a href="https://rh347.host.cs.st-andrews.ac.uk/">https://rh347.host.cs.st-andrews.ac.uk/</a></span>
-<br />Address: <br />Ruth Hoffmann<br /> School of Computer Science,<br /> University of St. Andrews,<br /> North Haugh,<br /> St. Andrews,<br /> Fife,<br /> KY16 9SS,<br /> SCOTLAND<br />
+<br />Address: <br />School of Computer Science,<br /> University of St. Andrews,<br /> North Haugh,<br /> St. Andrews,<br /> Fife,<br /> KY16 9SS,<br /> SCOTLAND<br />
 </p><p><b>
     Steve Linton
 
@@ -67,7 +67,7 @@ <h2>A permutation pattern class package</h2>
 
   </b>
 <br />Email: <span class="URL"><a href="mailto:[email protected]">[email protected]</a></span>
-<br />Homepage: <span class="URL"><a href="http://www.cs.otago.ac.nz/staff/michael.html">http://www.cs.otago.ac.nz/staff/michael.html</a></span>
+<br />Homepage: <span class="URL"><a href="https://www.otago.ac.nz/computer-science/people/Michael_Albert.html">https://www.otago.ac.nz/computer-science/people/Michael_Albert.html</a></span>
 <br />Address: <br />Michael Albert<br /> Department of Computer Science,<br /> University of Otago,<br /> PO Box 56,<br /> DUNEDIN 9054,<br /> New Zealand,<br />
 </p>
 
@@ -255,19 +255,17 @@ <h3>Contents<a id="contents" name="contents"></a></h3>
 <span class="ContSS"><br /><span class="nocss">&nbsp;&nbsp;</span><a href="chap10_mj.html#X8503A7707FA666C4">10.2-2 LoopVertexFreeAut</a></span>
 </div></div>
 </div>
-<div class="ContChap"><a href="chapInd_mj.html"><span class="Heading">Index</span></a></div>
 <div class="ContChap"><a href="chapBib_mj.html"><span class="Heading">References</span></a></div>
+<div class="ContChap"><a href="chapInd_mj.html"><span class="Heading">Index</span></a></div>
 <br />
 </div>
-<p> </p>
-
 
 <div class="chlinkprevnextbot">&nbsp;<a href="chap0_mj.html">[Top of Book]</a>&nbsp;  <a href="chap0_mj.html#contents">[Contents]</a>&nbsp;  &nbsp;<a href="chap1_mj.html">[Next Chapter]</a>&nbsp;  </div>
 
 
 <div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><a href="chap0_mj.html">Top</a>  <a href="chap1_mj.html">1</a>  <a href="chap2_mj.html">2</a>  <a href="chap3_mj.html">3</a>  <a href="chap4_mj.html">4</a>  <a href="chap5_mj.html">5</a>  <a href="chap6_mj.html">6</a>  <a href="chap7_mj.html">7</a>  <a href="chap8_mj.html">8</a>  <a href="chap9_mj.html">9</a>  <a href="chap10_mj.html">10</a>  <a href="chapBib_mj.html">Bib</a>  <a href="chapInd_mj.html">Ind</a>  </div>
 
 <hr />
-<p class="foot">generated by <a href="http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
+<p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
 </body>
 </html>

doc/chap1.html

@@ -26,13 +26,13 @@
 
 <h3>1 <span class="Heading">Introduction</span></h3>
 
-<p>Token passing networks (TPNs) are directed graphs with nodes that can hold at most one token. Also each graph has a designated input node, which generates an ordered sequence of numbered tokens and a designated output node that collects the tokens in the order they arrive at it. The input node has no incoming edges, whereas the output node has no outgoing edges. A token <span class="SimpleMath">t</span> travels through the graph, from node to node, if there is an edge connecting the nodes, if the node the token is moving from is either the input node and the tokens <span class="SimpleMath">1, ..., t-1</span> have been released or the node is not the output node, and lastly if the destination node contains no token or it is the output node. <a href="chapBib.html#biBPermGenTPGraph">[3]</a></p>
+<p>Token passing networks (TPNs) are directed graphs with nodes that can hold at most one token. Also each graph has a designated input node, which generates an ordered sequence of numbered tokens and a designated output node that collects the tokens in the order they arrive at it. The input node has no incoming edges, whereas the output node has no outgoing edges. A token <span class="SimpleMath">t</span> travels through the graph, from node to node, if there is an edge connecting the nodes, if the node the token is moving from is either the input node and the tokens <span class="SimpleMath">1, ..., t-1</span> have been released or the node is not the output node, and lastly if the destination node contains no token or it is the output node. <a href="chapBib.html#biBPermGenTPGraph">[ALTnd]</a></p>
 
-<p>The set of permutations resulting from a TPN is closed under the property of containment. A permutation <span class="SimpleMath">a</span> contains a permutation <span class="SimpleMath">b</span> of shorter length if in <span class="SimpleMath">a</span> there is a subsequence that is isomorphic to <span class="SimpleMath">b</span>. This class of permutations can be represented by its anti-chain, which in this context is called the basis. <a href="chapBib.html#biBRegCloSetPerms">[2]</a></p>
+<p>The set of permutations resulting from a TPN is closed under the property of containment. A permutation <span class="SimpleMath">a</span> contains a permutation <span class="SimpleMath">b</span> of shorter length if in <span class="SimpleMath">a</span> there is a subsequence that is isomorphic to <span class="SimpleMath">b</span>. This class of permutations can be represented by its anti-chain, which in this context is called the basis. <a href="chapBib.html#biBRegCloSetPerms">[AAR03]</a></p>
 
-<p>To enhance the computability of permutation pattern classes, each permutation can be encoded, using the so called rank encoding. For a permutation <span class="SimpleMath">p_1 ... p_n</span>, it is the sequence <span class="SimpleMath">e_1... e_n</span> where <span class="SimpleMath">e_i</span> is the rank of <span class="SimpleMath">p_i</span> among <span class="SimpleMath">{p_i,p_i+1,...,p_n}</span>. It can be shown that the sets of encoded permutations of the class and the basis, both are a rational languages. Rational languages can be represented by automata. <a href="chapBib.html#biBRegCloSetPerms">[2]</a></p>
+<p>To enhance the computability of permutation pattern classes, each permutation can be encoded, using the so called rank encoding. For a permutation <span class="SimpleMath">p_1 ... p_n</span>, it is the sequence <span class="SimpleMath">e_1... e_n</span> where <span class="SimpleMath">e_i</span> is the rank of <span class="SimpleMath">p_i</span> among <span class="SimpleMath">{p_i,p_i+1,...,p_n}</span>. It can be shown that the sets of encoded permutations of the class and the basis, both are a rational languages. Rational languages can be represented by automata. <a href="chapBib.html#biBRegCloSetPerms">[AAR03]</a></p>
 
-<p>There is another approach to get from TPNs to their corresponding automata. Namely building equivalence classes from TPNs using the different dispositions of tokens within them. These equivalence classes of dispositions and the rank encoding of the permutations allow to build the same rational language as from the process above. <a href="chapBib.html#biBPermGenTPGraph">[3]</a></p>
+<p>There is another approach to get from TPNs to their corresponding automata. Namely building equivalence classes from TPNs using the different dispositions of tokens within them. These equivalence classes of dispositions and the rank encoding of the permutations allow to build the same rational language as from the process above. <a href="chapBib.html#biBPermGenTPGraph">[ALTnd]</a></p>
 
 
 <div class="chlinkprevnextbot">&nbsp;<a href="chap0.html">[Top of Book]</a>&nbsp;  <a href="chap0.html#contents">[Contents]</a>&nbsp;  &nbsp;<a href="chap0.html">[Previous Chapter]</a>&nbsp;  &nbsp;<a href="chap2.html">[Next Chapter]</a>&nbsp;  </div>
@@ -41,6 +41,6 @@ <h3>1 <span class="Heading">Introduction</span></h3>
 <div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><a href="chap0.html">Top</a>  <a href="chap1.html">1</a>  <a href="chap2.html">2</a>  <a href="chap3.html">3</a>  <a href="chap4.html">4</a>  <a href="chap5.html">5</a>  <a href="chap6.html">6</a>  <a href="chap7.html">7</a>  <a href="chap8.html">8</a>  <a href="chap9.html">9</a>  <a href="chap10.html">10</a>  <a href="chapBib.html">Bib</a>  <a href="chapInd.html">Ind</a>  </div>
 
 <hr />
-<p class="foot">generated by <a href="http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
+<p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
 </body>
 </html>

doc/chap1.txt

@@ -10,24 +10,24 @@
   connecting  the  nodes,  if  the node the token is moving from is either the
   input  node and the tokens 1, ..., t-1 have been released or the node is not
   the  output node, and lastly if the destination node contains no token or it
-  is the output node. [3]
+  is the output node. [ALTnd]
 
   The set of permutations resulting from a TPN is closed under the property of
   containment.  A  permutation a contains a permutation b of shorter length if
   in  a  there  is  a  subsequence  that  is  isomorphic  to  b. This class of
   permutations  can be represented by its anti-chain, which in this context is
-  called the basis. [2]
+  called the basis. [AAR03]
 
   To   enhance   the   computability  of  permutation  pattern  classes,  each
   permutation  can  be  encoded,  using  the  so  called  rank encoding. For a
   permutation p_1 ... p_n, it is the sequence e_1... e_n where e_i is the rank
   of  p_i  among {p_i,p_i+1,...,p_n}. It can be shown that the sets of encoded
   permutations  of  the  class  and  the basis, both are a rational languages.
-  Rational languages can be represented by automata. [2]
+  Rational languages can be represented by automata. [AAR03]
 
   There  is another approach to get from TPNs to their corresponding automata.
   Namely   building   equivalence   classes  from  TPNs  using  the  different
   dispositions   of   tokens   within   them.  These  equivalence  classes  of
   dispositions  and  the  rank encoding of the permutations allow to build the
-  same rational language as from the process above. [3]
+  same rational language as from the process above. [ALTnd]
 

doc/chap10.html

@@ -174,13 +174,15 @@ <h5>10.2-2 LoopVertexFreeAut</h5>
 Accepting state: [ 1 ]
 <span class="GAPprompt">gap&gt;</span> <span class="GAPinput"></span></pre></div>
 
+<p> </p>
+
 
 <div class="chlinkprevnextbot">&nbsp;<a href="chap0.html">[Top of Book]</a>&nbsp;  <a href="chap0.html#contents">[Contents]</a>&nbsp;  &nbsp;<a href="chap9.html">[Previous Chapter]</a>&nbsp;  &nbsp;<a href="chapBib.html">[Next Chapter]</a>&nbsp;  </div>
 
 
 <div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><a href="chap0.html">Top</a>  <a href="chap1.html">1</a>  <a href="chap2.html">2</a>  <a href="chap3.html">3</a>  <a href="chap4.html">4</a>  <a href="chap5.html">5</a>  <a href="chap6.html">6</a>  <a href="chap7.html">7</a>  <a href="chap8.html">8</a>  <a href="chap9.html">9</a>  <a href="chap10.html">10</a>  <a href="chapBib.html">Bib</a>  <a href="chapInd.html">Ind</a>  </div>
 
 <hr />
-<p class="foot">generated by <a href="http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
+<p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
 </body>
 </html>

doc/chap10.txt

@@ -138,3 +138,5 @@
     gap> 
   
 
+   
+