Difference between revisions of "Vcsn"

From LRDE

Line 17: Line 17:
 
</center>
 
</center>
   
Vaucanson is a platform dedicated to the computation of, and with,
+
Vcsn is a platform dedicated to the computation of, and with,
 
finite state machines. It provides an efficient C++ library, a Python
 
finite state machines. It provides an efficient C++ library, a Python
 
interface, and a graphical user interface on top of IPython.
 
interface, and a graphical user interface on top of IPython.
Line 33: Line 33:
 
obtain efficient code from algorithms written in an abstract way.
 
obtain efficient code from algorithms written in an abstract way.
   
Vaucanson benefits from the expertise the LRDE gained from our
+
Vcsn benefits from the expertise the LRDE gained from our
 
intensive work on high performance generic programming for Olena. On
 
intensive work on high performance generic programming for Olena. On
 
the other hand, its theoretical well-foundedness is ensured by Jacques
 
the other hand, its theoretical well-foundedness is ensured by Jacques
 
Sakarovitch, at Télécom ParisTech, and with Sylvain Lombardy at the
 
Sakarovitch, at Télécom ParisTech, and with Sylvain Lombardy at the
 
Laboratoire Bordelais de Recherche en Informatique.
 
Laboratoire Bordelais de Recherche en Informatique.
 
About ten years after its first inception, the project is taking a new
 
start with the Vaucanson 2 effort. This complete redesign aims at
 
keeping the successful parts of its predecessor (especially genericity
 
and large feature set) while addressing its shortcomings (compile-time
 
and runtime efficiency, flexibility).
 
   
 
<center>
 
<center>

Revision as of 14:54, 1 October 2015


Vcsn-logo.png

Logo Telecom Paristech.pngLrde.pngLogo Labri.jpg

Try it Download Python doc C++ doc

Vcsn is a platform dedicated to the computation of, and with, finite state machines. It provides an efficient C++ library, a Python interface, and a graphical user interface on top of IPython.

Here finite state machines is to be understood in the broadest possible sense: finite automata with multiple tapes — often called transducers then — or even more generally finite automata with multiplicity, that is, automata that not only accept sequences of symbols but compute for such sequence a "value" that is associated with it and which can be taken in any semiring.

Indeed, our framework is the set of automata with multiplicity over any semiring: a general algorithm is written just once and can be instantiated to any particular kind of automaton. As a result, we obtain efficient code from algorithms written in an abstract way.

Vcsn benefits from the expertise the LRDE gained from our intensive work on high performance generic programming for Olena. On the other hand, its theoretical well-foundedness is ensured by Jacques Sakarovitch, at Télécom ParisTech, and with Sylvain Lombardy at the Laboratoire Bordelais de Recherche en Informatique.

Latest News (more...)

  • May 8th, 2018: Vcsn 2.8 is released!
  • March 15th, 2018: Vcsn 2.7 is released!
  • November 13th, 2017: Vcsn 2.6 is released!
  • January 28th, 2017: Vcsn 2.5 is released!
  • November 16th, 2016: Vcsn 2.4 is released!
  • July 8th, 2016: Vcsn 2.3 is released!
  • February 19th, 2016: Vcsn 2.2 is released!
  • October 11th, 2015: Vcsn 2.1 is released!
  • October 1st, 2015: Vcsn's git repository moved.
Run git remote set-url origin git@gitlab.lrde.epita.fr:vcsn/vcsn in your old repository to retarget it.


Information, Documentation

Resources

Development

The following resources are the group's main means of discussion:

Contact

Send any question or comments to vaucanson@lrde.epita.fr.
Send bug reports to vaucanson-bugs@lrde.epita.fr.