AG: A set of Maple packages for manipulating automata and finite semigroups. AG is a set of packages for manipulating finite state automata and finite semigroups. This software includes on the one hand the AUTOMAP package which affords the usual operations on automata (union, concatenation, Kleene closure,.) as well as the usual transformations (trimming, minimization,.) and on the other hand the GREEN package which yields the (regular or not) D-class structure of a finite monoid. The AG software has been implemented using the Maple symbolic computation system. ©1997 by John Wiley & Sons, Ltd.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Caron, Pascal: Families of locally testable languages (2000)
- Caron, Pascal: LANGAGE: A Maple package for automaton characterization of regular languages (2000)
- Caron, Pascal; Ziadi, Djelloul: Characterization of Glushkov automata (2000)
- Caron, Pascal: AG: a set of Maple packages for manipulating automata and semigroups. (1997)