How to Install and Uninstall gap-patternclass Package on openSUSE Leap
Last updated: November 07,2024
Deprecated! Installation of this package may no longer be supported.
1. Install "gap-patternclass" package
Please follow the guidance below to install gap-patternclass on openSUSE Leap
$
sudo zypper refresh
Copied
$
sudo zypper install
gap-patternclass
Copied
2. Uninstall "gap-patternclass" package
This guide covers the steps necessary to uninstall gap-patternclass on openSUSE Leap:
$
sudo zypper remove
gap-patternclass
Copied
3. Information about the gap-patternclass package on openSUSE Leap
Information for package gap-patternclass:
-----------------------------------------
Repository : Main Repository
Name : gap-patternclass
Version : 2.4.1-bp153.1.12
Arch : noarch
Vendor : openSUSE
Installed Size : 2,5 MiB
Installed : No
Status : not installed
Source package : gap-patternclass-2.4.1-bp153.1.12.src
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 : Main Repository
Name : gap-patternclass
Version : 2.4.1-bp153.1.12
Arch : noarch
Vendor : openSUSE
Installed Size : 2,5 MiB
Installed : No
Status : not installed
Source package : gap-patternclass-2.4.1-bp153.1.12.src
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.