Upstream software project

gap-pkg-kbmag

GAP: Knuth-Bendix on Monoids and Automatic Groups

About gap-pkg-kbmag

GAP: Knuth-Bendix on Monoids and Automatic Groups

This project links 6 native package records across 4 recorded operating-system releases. Compare the retained versions and architectures below, then open the package for your own release.

These are catalog observations, not a guarantee of installation, compatibility, or upstream support.

Project pictures and package coverage

Fedora 43: 2 package records; Fedora 44: 2 package records; openSUSE Leap 16.0: 1 package records; openSUSE Tumbleweed: 1 package records. Catalog coverage diagram, not an application screenshot.gap-pkg-kbmag: recorded package coverageFedora 432 recordsFedora 442 recordsopenSUSE Leap 16.01 recordsopenSUSE Tumbleweed1 records
OpenFactory diagram of linked package records. It is not an application screenshot.

Project identity

Project
gap-pkg-kbmag
Publisher
Not authoritatively mapped
Native package records
6
Operating systems
fedora-43, fedora-44, opensuse-leap-16-0, opensuse-tumbleweed
License expression
GPL-2.0-or-later
Source repository
Not reported

Source-reported description

The fullest retained description is shown with its source. Distribution packaging descriptions may include downstream details.

KBMAG (pronounced Kay-bee-mag) stands for Knuth-Bendix on Monoids, and Automatic Groups. It is a stand-alone package written in C, for use under UNIX, with an interface to GAP. There are interfaces for the use of KBMAG with finitely presented groups, monoids and semigroups defined within GAP. The package also contains a collection of routines for manipulating finite state automata, which can be accessed via the GAP interface. The overall objective of KBMAG is to construct a normal form for the elements of a finitely presented group G in terms of the given generators together with a word reduction algorithm for calculating the normal form representation of an element in G, given as a word in the generators. If this can be achieved, then it is also possible to enumerate the words in normal form up to a given length, and to determine the order of the group, by counting the number of words in normal form. In most serious applications, this will be infinite, since finite groups are (with some exceptions) usually handled better by Todd-Coxeter related methods. In fact a finite state automaton W is calculated that accepts precisely the language of words in the group generators that are in normal form, and W is used for the enumeration and counting functions. It is possible to inspect W directly if required; for example, it is often possible to use W to determine whether an element in G has finite or infinite order. The normal form for an element g in G is defined to be the least word in the group generators (and their inverses) that represents G, with respect to a specified ordering on the set of all words in the group generators. KBMAG offers two possible means of achieving these objectives. The first is to apply the Knuth-Bendix algorithm to the group presentation, with one of the available orderings on words, and hope that the algorithm will complete with a finite confluent presentation. (If the group is finite, then it is guaranteed to complete eventually but, like the Todd-Coxeter procedure, it may take a long time, or require more space than is available.) The second is to use the automatic group program. This also uses the Knuth-Bendix procedure as one component of the algorithm, but it aims to compute certain finite state automata rather than to obtain a finite confluent rewriting system, and it completes successfully on many examples for which such a finite system does not exist. In the current implementation, its use is restricted to the shortlex ordering on words. That is, words are ordered first by increasing length, and then words of equal length are ordered lexicographically, using the specified ordering of the generators. The GAP4 version of KBMAG also offers extensive facilities for finding confluent presentations and finding automatic structures relative to a specified finitely generated subgroup of the group G. Finally, there is a collection of functions for manipulating finite state automata that may be of independent interest.

Description source

Packages by operating system

Compare recorded versions, then open a package for dependency, file, checksum, and repository evidence. Version strings are distribution-specific, not a ranking of newer software.

Fedora 43

  1. Package gap-pkg-kbmag

    43 (Fedora 43) (Unspecified): Knuth-Bendix on Monoids and Automatic Groups

    1.5.11-5.fc43: aarch64 x86_64

    Source: gap-pkg-kbmag

  2. Package gap-pkg-kbmag-doc

    43 (Fedora 43) (Unspecified): Documentation for the GAP kbmag package

    1.5.11-5.fc43: noarch

    Source: gap-pkg-kbmag

Fedora 44

  1. Package gap-pkg-kbmag

    44 (Fedora 44) (Unspecified): Knuth-Bendix on Monoids and Automatic Groups

    1.6.0-1.fc44: aarch64 x86_64

    Source: gap-pkg-kbmag

  2. Package gap-pkg-kbmag-doc

    44 (Fedora 44) (Unspecified): Documentation for the GAP kbmag package

    1.6.0-1.fc44: noarch

    Source: gap-pkg-kbmag

openSUSE Leap 16.0

  1. Package gap-kbmag

    leap-16.0 (openSUSE Leap 16.0) (Productivity/Scientific/Math): GAP: Knuth-Bendix on Monoids and Automatic Groups

    1.5.11-bp160.1.12: aarch64 ppc64le s390x x86_64

    Source: gap-kbmag

openSUSE Tumbleweed

  1. Package gap-kbmag

    tumbleweed (openSUSE Tumbleweed) (Productivity/Scientific/Math): GAP: Knuth-Bendix on Monoids and Automatic Groups

    1.5.11-1.6: x86_64

    Source: gap-kbmag

Project resources and further reading

Mapping provenance

Only source-backed identity signals create public cross-OS links. A reviewer can later approve or dispute an inferred relationship without rewriting native package history.

No field-level source record is published yet.