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.
On Jan 10, 2008 9:04 PM, ab <[EMAIL PROTECTED]> wrote:
>
> I'd be interested in having code from my Python DFA (Deterministic
> Finite Automaton) package included in SAGE, as I saw that it doesn't
> seem to have one yet. You can find the project at
> http://code.google.com/p/python-automata/
> (svn version of code recommended). Would it be a good fit? What's the
> process?
>
> Andrew
>
> >
>
--~--~---------~--~----~------------~-------~--~----~
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/
-~----------~----~----~----~------~----~------~--~---
