Introducing Vaucanson. Lombardy, S., Poss, R., Régis-Gianas, Y., & Sakarovitch, J. In Proc. 8th International Conference on Implementation and Application of Automata (CIAA'03), volume 2759, of Lecture Notes in Computer Science Series, pages 96–107, Santa Barbara, CA, USA, July, 2003. Springer-Verlag. Doi Local doi abstract bibtex 3 downloads 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.
@inproceedings{lombardy03ciaa,
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.},
Address = {Santa Barbara, CA, USA},
Author = {Sylvain Lombardy and Raphael Poss and Yann R{\'e}gis-Gianas and Jacques Sakarovitch},
Booktitle = {Proc. 8th International Conference on Implementation and Application of Automata (CIAA'03)},
Doi = {10.1007/3-540-45089-0_10}, Urldoi = {http://dx.doi.org/10.1007/3-540-45089-0_10},
Keywords = {Vaucanson, finite state automata, C++, generic programming},
Month = {July},
Pages = {96--107},
Project = {Vaucanson},
Publisher = {Springer-Verlag},
Read = {Oui},
Series = {Lecture Notes in Computer Science Series},
Title = {Introducing {V}aucanson},
Urllocal = {pub/lombardy.03.ciaa.pdf},
Volume = {2759},
Year = {2003},
}
Downloads: 3
{"_id":{"_str":"5342bd570e946d920a003510"},"__v":1,"authorIDs":["54c2dea9b5fb1e5511000919","5dfafc26fa2bbbde01000122","5e35eb445cd57fde01000070","5e38ff13dc5b8ade01000077","5e64a5962551dede01000063","ZGRaLkjmxPcmJ739z","efnDKftzuGYiXXauW","pgjx6rQxQDmzHuwRK","sCob7zjTXbp95CmbP"],"author_short":["Lombardy, S.","Poss, R.","Régis-Gianas, Y.","Sakarovitch, J."],"bibbaseid":"lombardy-poss-rgisgianas-sakarovitch-introducingvaucanson-2003","bibdata":{"bibtype":"inproceedings","type":"inproceedings","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.","address":"Santa Barbara, CA, USA","author":[{"firstnames":["Sylvain"],"propositions":[],"lastnames":["Lombardy"],"suffixes":[]},{"firstnames":["Raphael"],"propositions":[],"lastnames":["Poss"],"suffixes":[]},{"firstnames":["Yann"],"propositions":[],"lastnames":["Régis-Gianas"],"suffixes":[]},{"firstnames":["Jacques"],"propositions":[],"lastnames":["Sakarovitch"],"suffixes":[]}],"booktitle":"Proc. 8th International Conference on Implementation and Application of Automata (CIAA'03)","doi":"10.1007/3-540-45089-0_10","urldoi":"http://dx.doi.org/10.1007/3-540-45089-0_10","keywords":"Vaucanson, finite state automata, C++, generic programming","month":"July","pages":"96–107","project":"Vaucanson","publisher":"Springer-Verlag","read":"Oui","series":"Lecture Notes in Computer Science Series","title":"Introducing Vaucanson","urllocal":"pub/lombardy.03.ciaa.pdf","volume":"2759","year":"2003","bibtex":"@inproceedings{lombardy03ciaa,\n\tAbstract = {This paper reports on a new software platform\n dedicated to the computation with automata and\n transducers, called Vaucanson, the main feature of\n which is the capacity of dealing with automata whose\n labels may belong to various algebraic\n structures. The paper successively shows how\n Vaucanson allows to program algorithms on automata\n in a way which is very close to the mathematical\n expression of the algorithm, describes some features\n of the Vaucanson platform, including the fact that\n the very rich data structure used to implement\n automata does not weight too much on the performance\n and finally explains the main issues of the\n programming design that allow to achieve both\n genericity and efficiency.},\n\tAddress = {Santa Barbara, CA, USA},\n\tAuthor = {Sylvain Lombardy and Raphael Poss and Yann R{\\'e}gis-Gianas and Jacques Sakarovitch},\n\tBooktitle = {Proc. 8th International Conference on Implementation and Application of Automata (CIAA'03)},\n\n\n\tDoi = {10.1007/3-540-45089-0_10}, Urldoi = {http://dx.doi.org/10.1007/3-540-45089-0_10},\n\tKeywords = {Vaucanson, finite state automata, C++, generic programming},\n\tMonth = {July},\n\tPages = {96--107},\n\tProject = {Vaucanson},\n\tPublisher = {Springer-Verlag},\n\tRead = {Oui},\n\tSeries = {Lecture Notes in Computer Science Series},\n\tTitle = {Introducing {V}aucanson},\n\tUrllocal = {pub/lombardy.03.ciaa.pdf},\n\tVolume = {2759},\n\tYear = {2003},\n\t}\n\n","author_short":["Lombardy, S.","Poss, R.","Régis-Gianas, Y.","Sakarovitch, J."],"key":"lombardy03ciaa","id":"lombardy03ciaa","bibbaseid":"lombardy-poss-rgisgianas-sakarovitch-introducingvaucanson-2003","role":"author","urls":{"Doi":"http://dx.doi.org/10.1007/3-540-45089-0_10","Local":"science.raphael.poss.name/pub/lombardy.03.ciaa.pdf"},"keyword":["Vaucanson","finite state automata","C++","generic programming"],"metadata":{"authorlinks":{"poss, r":"https://bibbase.org/show?bib=https%3A%2F%2Fscience.raphael.poss.name%2Fpub.bib"}},"downloads":3,"html":""},"bibtype":"inproceedings","biburl":"science.raphael.poss.name/pub.bib","downloads":3,"keywords":["vaucanson","finite state automata","c++","generic programming"],"search_terms":["introducing","vaucanson","lombardy","poss","régis-gianas","sakarovitch"],"title":"Introducing Vaucanson","year":2003,"dataSources":["75cdFjzQkYc9cKbYS","nMjrEFThibKqpZt4n","ob9Lo6tki9nBzzxK9"]}