|
Size: 1596
Comment:
|
Size: 2006
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 4: | Line 4: |
| * faster | * faster [some caching will be implemented] |
| Line 7: | Line 7: |
| * consider using Streams and (Lazy)Familys here. | * '''Franco''': consider using Streams and (Lazy)Familys here. [Streams doesn't exactly do what we need, but the ideas are interesting (caching)] |
| Line 9: | Line 9: |
| * allow for words over arbitrary alphabets? (example, the alphabet of the elements of a group) | * '''Franco''': allow for words over arbitrary alphabets? (example, the alphabet of the elements of a group) [Franco can implement any CombinatorialClass as an alphabet] |
| Line 12: | Line 12: |
| * Language * FixedPointOfMorphism (things like the language, complexity, ..., can be computed). |
* '''Sebastien, Vincent''': Language * '''Vincent''': FixedPointOfMorphism (things like the language, complexity, ..., can be computed). |
| Line 15: | Line 15: |
| * Dyck Word, discussions about getting DyckWord to inherit from WordPaths, comparisons of efficiency. | * Dyck Word, discussions about getting DyckWord to inherit from Language, comparisons of efficiency. |
| Line 21: | Line 21: |
| * Add Random Word and Random Testing | * [needs fixing] Add Random Word (combine arguments m and alphabet) * fix random_element for Words * Random Testing (how do we do this?) |
| Line 29: | Line 31: |
| * trac #4954: Words_over_Alphabet should check the type of input alphabet | * trac #4954: Words_over_Alphabet should check the type of input alphabet (related to allowing CombinatorialClass as alphabets) |
Words Sprint (FrancoSaliola, Sébastien Labbé, Vincent Delecroix)
- New implementation for words:
- faster [some caching will be implemented]
- space efficient
- special class for words over an alphabet of at most two letters (each letter takes one bit)
Franco: consider using Streams and (Lazy)Familys here. [Streams doesn't exactly do what we need, but the ideas are interesting (caching)]
- discussion about the content-datastructure-as-subobject (anti?)design pattern
Franco: allow for words over arbitrary alphabets? (example, the alphabet of the elements of a group) [Franco can implement any CombinatorialClass as an alphabet]
- New classes:
Sebastien, Vincent: Language
Vincent: FixedPointOfMorphism (things like the language, complexity, ..., can be computed).
- Lyndon word class
Dyck Word, discussions about getting DyckWord to inherit from Language, comparisons of efficiency.
- bi-infinite words, or more generally, words indexed by objects other than integers
- bi-infinite alphabets (like integers)
- New words:
- Generalized Thue-Morse words to words.[TAB]
- [needs fixing] Add Random Word (combine arguments m and alphabet)
- fix random_element for Words
- Random Testing (how do we do this?)
- Geometrization:
WordMorphism, following the work of G. Rauzy, A. Siegel, P. Arnoux, ...
- Word Paths, via words as paths in a lattice
- Miscellaneous:
- add notes about words library
trac #4954: Words_over_Alphabet should check the type of input alphabet (related to allowing CombinatorialClass as alphabets)
- finish and post words_new_fct_sl.patch to trac #5037
- discussions regarding the trac #5002
look through the algorithms for finite words, and identify the ones that need improvement (some are really slow, like is_subword_of)
WordMorphism, inherits from SageObject and it should be a more general Morphism class.