Hello, i read you were applying for GSOC this year. I've gone through the ideas page and found some i could enjoy working on like the Internationalization of the notebook and the notebook itself.
Beside those.. do you think it's a good idea to propose Finite Automata support? I'm coursing Languages Design this semester (until June) and doing a Lexical analyzer and parser generator (like lexx & a) as a project written in Scala. I don't know if it's a good idea to propose to write the classes from scratch, or to use a library (like NetworkX with Graph support), recommendations? If I were to write it from scratch, my idea is to write at least - Non-deterministic and deterministic Finite Atomata classes: I've seen #4854 <http://trac.sagemath.org/sage_trac/ticket/4854> from a message on this list and It also occurs to me that they could be built from a Graph. - Subset subconstruction algorithm (NFA -> DFA) - Direct conversion from regular expressions to DFA - Direct conversion from regular expressions to NFA (with different algorithms, which i don't know if it's appropiate: Thompson, Glushkov and I'd like to implement this one as well: http://portal.acm.org/citation.cfm?id=986537.986588) - State-minimizing algorithm for DFAs I'm interested in LaTeX support as well, so I could think of embedding Automatas drawn with TikZ/PGF, that of course, as a plus. That is what I got on the top of my head, I'd appreciate if you can tell me what do you think. Regards, Carlos López -- 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
