Sage has no Module/Class for things like Finite State Machines, Automata and Transducers. That should be changed. ;)
I think the following things should be possible: - Creating new automata/transducer from given ones which do union, intersection, ... of the corresponding generated languages. - Determinization. - Minimization. - Creating automata/transducer given a transition function. - Using output of one transducer as input of another. - Plotting (of the underlying directed graph). (Feel free to extend this list.) At the moment I think about the following: In which way could this be done "good"? One idea is to derive it directly from DiGraph and use a class "State" as label for each vertex and a class Transition as label for an edge. If you have any comments on that, let me know. (I mean, tell me, if that is a bad idea, how it can be done better, what I should be aware of, and so on.) Further, there are a lot of packages written in Python on that things, but it seems, that each is just for a special purpose; nothing that can be easily adapted to do all (and maybe more) of the things above. So the question here is: Does anyone know about a "good" package (that could be used in Sage, too)? Daniel -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
