Difference between revisions of "Publications/lombardy.03.ciaa"
From LRDE
(3 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
{{Publication |
{{Publication |
||
+ | | published = true |
||
| date = 2003-05-05 |
| date = 2003-05-05 |
||
| authors = Sylvain Lombardy, Raphaël Poss, Yann Régis-Gianas, Jacques Sakarovitch |
| authors = Sylvain Lombardy, Raphaël Poss, Yann Régis-Gianas, Jacques Sakarovitch |
||
Line 10: | Line 11: | ||
| series = Lecture Notes in Computer Science |
| series = Lecture Notes in Computer Science |
||
| address = Santa Barbara, CA, USA |
| address = Santa Barbara, CA, USA |
||
− | | project = Vaucanson |
||
− | | urllrde = 200307-Ciaa |
||
⚫ | | 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. |
||
| lrdeprojects = Vaucanson |
| lrdeprojects = Vaucanson |
||
⚫ | | 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. |
||
| lrdenewsdate = 2003-05-05 |
| lrdenewsdate = 2003-05-05 |
||
| type = inproceedings |
| type = inproceedings |
||
Line 32: | Line 31: | ||
address = <nowiki>{</nowiki>Santa Barbara, CA, USA<nowiki>}</nowiki>, |
address = <nowiki>{</nowiki>Santa Barbara, CA, USA<nowiki>}</nowiki>, |
||
month = jul, |
month = jul, |
||
− | project = <nowiki>{</nowiki>Vaucanson<nowiki>}</nowiki>, |
||
abstract = <nowiki>{</nowiki>This paper reports on a new software platform dedicated to |
abstract = <nowiki>{</nowiki>This paper reports on a new software platform dedicated to |
||
the computation with automata and transducers, called |
the computation with automata and transducers, called |
Latest revision as of 18: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.} }