Processing Math: Done
jsMath
Differences between revisions 2 and 3
Revision 2 as of 2009-06-14 09:50:43
Size: 537
Comment:
Revision 3 as of 2009-06-14 09:54:24
Size: 684
Comment:
Deletions are marked like this. Additions are marked like this.
Line 7: Line 7:
 * rationnal languages and automata  * rationnal languages / automata
Line 11: Line 11:
 * S-adic description of a language (including the particular case of the fixed point of a moprhism)
 * Tree representation (prefixes or suffixes)

Languages Design

GOAL

Using the now almost ready words (next generation) library, it's time to think about a Language category. This library should include the following feature :

  • rationnal languages / automata
  • subshift of finite type / Rauzy graphs
  • language of infinite word (almost done in words)
  • language of a morphism
  • S-adic description of a language (including the particular case of the fixed point of a moprhism)
  • Tree representation (prefixes or suffixes)

We have to think and be careful with the non empty intersections with :

  • the monoidal category (especially the free one)
  • graphs and trees
  • representation of numbers

LanguagesDesign (last edited 2009-06-14 09:54:24 by VincentDelecroix)