Difference between revisions of "Publications/lombardy.03.ciaa"

From LRDE

 
Line 5: Line 5:
 
| title = Introducing Vaucanson
 
| title = Introducing Vaucanson
 
| booktitle = Proceedings of Implementation and Application of Automata8th International Conference (CIAA'03)
 
| booktitle = Proceedings of Implementation and Application of Automata8th International Conference (CIAA'03)
| pages = 96–107
+
| pages = 96 to 107
 
| editors = Oscar H Ibarra, Zhe Dang
 
| editors = Oscar H Ibarra, Zhe Dang
 
| publisher = Springer
 
| publisher = Springer

Latest revision as of 17:57, 4 January 2018

Abstract

This paper reports on a new software platform dedicated to the computation with automata and transducers, called Vaucanson, the main feature of which 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 weight too much on the performance and finally explains the main issues of the programming design that allow to achieve both genericity and efficiency.


Bibtex (lrde.bib)

@InProceedings{	  lombardy.03.ciaa,
  author	= {Sylvain Lombardy and Rapha\"el Poss and Yann
		  R\'egis-Gianas and Jacques Sakarovitch},
  title		= {Introducing {V}aucanson},
  booktitle	= {Proceedings of Implementation and Application of Automata,
		  8th International Conference (CIAA'03)},
  pages		= {96--107},
  year		= 2003,
  editor	= {Oscar H. Ibarra and Zhe Dang},
  publisher	= {Springer},
  volume	= 2759,
  series	= {Lecture Notes in Computer Science},
  address	= {Santa Barbara, CA, USA},
  month		= jul,
  abstract	= {This paper reports on a new software platform dedicated to
		  the computation with automata and transducers, called
		  Vaucanson, the main feature of which 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 weight too
		  much on the performance and finally explains the main
		  issues of the programming design that allow to achieve both
		  genericity and efficiency.}
}