Abstract
AG is a set of packages for manipulat ing finite state au toma ta and finite semigroups. This software includes on the one hand the AUTOMAP package which affords the usual operations on au t om a t a (union, concatenation, Kleene closure, . . . ) as well as the usual t ransformations (tr imming, minimization, . . . ) and on the other hand the GREEN package which yields the (regular or not) O-classes structure of a finite monoid. The AG software has been implemented using the Maple symbolic computat ion system. It is the first software manipula t ing aut o m a t a and semigroups and developed inside a symbolic computa t ion system. As we show below in a session example, this feature enables users to implement their own procedures in order to test conjectures. So AG should be of a particular interest in the numerous domains of computer science where au toma ta have applications, such as protocol verification or modelisation of distr ibuted sys tems, . . .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
