Dear all, I'm currently implementing factorial languages which are just a set of words which stable under taking factors. Such object for sure should be a parent and the associated words its elements. Moreover, I suspect that a the good category would be FiniteEnumeratedSet or InfiniteEnumeratedSet (?). But there is an important structure which is omitted : a word has a length. Hence my set is graded and the number of objects of fixed length is finite (looks like Partitions() or Permutations()). Is there a plan for a category for it ? Are there standard names for * iterator over object of length n (in Words it is "iterate_by_length()") * the function n -> cardinality of word of length n (in language theory, a standard name seems to be "pattern complexity") * generating functions Also, the behavior of FiniteEnumeratedSet/InfiniteEnumeratedSet is not well adapted to the following * it seems natural to me that L[n] should return the set of words of length n (?) * __iter__ should just go through the iterate_by_length(n) for n from 0 to ...
Any advice or pointers through existing objects in Sage are welcome. Cheers, Vincent -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To post to this group, send email to sage-combinat-devel@googlegroups.com. To unsubscribe from this group, send email to sage-combinat-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en.
