PatternClass

Permutation Pattern Classes

Version 2.1
Michael Albert malbert at cs.otago.ac.nz
Steve Linton sl4 at st-andrews.ac.uk
Ruth Hoffmann rh347 at icloud.com
August 2015
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.
©right; 2011 by Michael Albert, Steve Linton and Ruth Hoffmann
<#Include SYSTEM "intro.xml"> <#Include SYSTEM "tpn.xml"> <#Include SYSTEM "encoding.xml"> <#Include SYSTEM "tpntoaut.xml"> <#Include SYSTEM "auttotpn.xml"> <#Include SYSTEM "classandbase.xml"> <#Include SYSTEM "basics.xml"> <#Include SYSTEM "props.xml"> <#Include SYSTEM "langs.xml"> <#Include SYSTEM "tmp.xml">