Introducing Vaucanson

From LRDE

Revision as of 17:57, 4 January 2018 by Bot (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 describes the main 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, shows how VAUCANSON allows to program algorithms on automata in a way which is very close to the mathematical expression of the algorithm and finally explains the main choices of the programming design that enable to achieve both genericity and efficiency.


Bibtex (lrde.bib)

@Article{	  lombardy.04.tcs,
  author	= {Sylvain Lombardy and Yann R\'egis-{G}ianas and Jacques
		  Sakarovitch},
  title		= {Introducing {V}aucanson},
  journal	= {Theoretical Computer Science},
  volume	= 328,
  year		= 2004,
  pages		= {77--96},
  month		= nov,
  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 describes the
		  main 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, shows
		  how VAUCANSON allows to program algorithms on automata in a
		  way which is very close to the mathematical expression of
		  the algorithm and finally explains the main choices of the
		  programming design that enable to achieve both genericity
		  and efficiency.}
}