How to Install and Uninstall gap-patternclass Package on openSuSE Tumbleweed
Last updated: November 24,2024
1. Install "gap-patternclass" package
This is a short guide on how to install gap-patternclass on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
gap-patternclass
Copied
2. Uninstall "gap-patternclass" package
Please follow the guidance below to uninstall gap-patternclass on openSuSE Tumbleweed:
$
sudo zypper remove
gap-patternclass
Copied
3. Information about the gap-patternclass package on openSuSE Tumbleweed
Information for package gap-patternclass:
-----------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : gap-patternclass
Version : 2.4.3-1.2
Arch : noarch
Vendor : openSUSE
Installed Size : 2.5 MiB
Installed : No
Status : not installed
Source package : gap-patternclass-2.4.3-1.2.src
Upstream URL : https://gap-packages.github.io/PatternClass/
Summary : GAP: Permutation pattern class
Description :
The PatternClass package is built 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 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.
-----------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : gap-patternclass
Version : 2.4.3-1.2
Arch : noarch
Vendor : openSUSE
Installed Size : 2.5 MiB
Installed : No
Status : not installed
Source package : gap-patternclass-2.4.3-1.2.src
Upstream URL : https://gap-packages.github.io/PatternClass/
Summary : GAP: Permutation pattern class
Description :
The PatternClass package is built 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 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.