Introducing Vaucanson

  • Sylvain Lombardy
  • Raphaël Poss
  • Yann Régis-Gianas
  • Jacques Sakarovitch
Conference paper

DOI: 10.1007/3-540-45089-0_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2759)
Cite this paper as:
Lombardy S., Poss R., Régis-Gianas Y., Sakarovitch J. (2003) Introducing Vaucanson. In: Ibarra O.H., Dang Z. (eds) Implementation and Application of Automata. CIAA 2003. Lecture Notes in Computer Science, vol 2759. Springer, Berlin, Heidelberg

Abstract

This paper reports on a new software platform called Vaucanson and dedicated to the computation with automata and transducers. Its main feature is the capacity of dealing with automata whose labels may belong to various algebraic structures.

The paper successively shows how Vaucanson allows to program algorithms on automata in a way which is very close to the mathematical expression of the algorithm, describes some features of the Vaucanson platform, including the fact that the very rich data structure used to implement automata does not weigh too much on the performance and finally explains the main choices of the programming design that enable to achieve both genericity and efficiency.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Sylvain Lombardy
    • 1
  • Raphaël Poss
    • 2
  • Yann Régis-Gianas
    • 2
  • Jacques Sakarovitch
    • 3
  1. 1.LIAFAUniversité Paris 7Paris
  2. 2.LRDEEPITAFrance
  3. 3.LTCICNRS / ENSTFrance

Personalised recommendations