Main Branches

Downloads  Installation  Overview  Data Libraries  Packages  Documentation  Contacts  FAQ  GAP 3 

Words, Rewriting, and Automata

These include
  • functions for calculating with words, in particular with associative words,

  • some set of functions dealing with rewriting systems,

  • the package kbmag providing the Knuth-Bendix method on Monoids and functions for Automatic Groups,

  • the package kan provides a collection of functions for computing with all types of Kan extension, including double coset rewriting systems.

  • the package IdRel provides functions for computing the identities among relators of an fp-group presentation using logged rewriting.

  • the package Automata, allowing to generate finite state automata and investigate its states.