On 1/10/08, David Joyner <[EMAIL PROTECTED]> wrote: > > First, I know essentially 0 about DFAs. However, I noticed that your > "well-documented Python library" contained no examples at all > and no references to the literature, except for the blurb: > > """... > See "Minimal cover-automata for finite languages" for context > on DFCAs, and > "An O(n^2) Algorithm for Constructing Minimal Cover Automata > for Finite Languages" > for the source of this algorithm (Campeanu, Paun, Santean, and > Yu). We follow their > algorithm exactly, except that "l" is optionally calculated > for you, and the state- > ordering is automatically created. > > There exists a faster, O(n*logn)-time algorithm due to Korner, > from CIAA 2002. > ... > """ > > I'd be happier to see > (1) some examples and > (2) specific detailed references like: > "For all DFA terms, we use Michael Sipser, Introduction to the Theory > of Computation. PWS, Boston. 1997" > or something like that. > > A comparison with what is out there already (and open source, of > course) would be > very helpful. > > Just my 2cents. It would be much better if someone who was more expert > on this commented though.
Where is Stephen Wolfram when you need him? Seriously though, could you as precisely as possible describe how what you do compares to what people do in: (1) mathemematica, maple, etc. (2) special purpose programs Is your program the best existing open source cellular automata program? If not, what would need to happen for it to become so? The goal in Sage really is to assemble together the absolutely very best open source software there is in each topic area. William --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
