gap-fr
GAP: Computations with functionally recursive groups
This package implements Functionally Recursive and Mealy automata in GAP. These objects can be manipulated as group elements, and various specific commands allow their manipulation as automorphisms of infinite rooted trees. Permutation quotients can also be created and manipulated as standard GAP groups or semigroups.
GPL-2.0-or-latercloud_download Downloads
To download packages, you need to log in and have a valid subscription.
Please select a product to see the available package versions:
Loading...
Loading package downloads...