Carl, Thanks for reply,
> Actually, it's quite easy to intersect two context-free languages A > and B: the answer is "the intersection of A and B", and I think it > would be great if Sage would allow you to form such an intersection > (if you're going to have lots of different kinds of languages > anyway). Of course, this intersection language would be missing many > methods -- you can't (always) test non-emptiness, as the most obvious > example -- but you can easily compute membership. Really, this is valid description of a language: an expression over other languages, simplified or not. Available methods are to be investigated recursively from what is known about expression parts and operations. Cute. I've read once that Maple-like expression decomposition capabilities were missed in Sage, what is the current situation?.. Is could be handy to leverage it. --Pavel. --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---