Difference between revisions of "Publications/lombardy.04.tcs"
From LRDE
(4 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
{{Publication |
{{Publication |
||
+ | | published = true |
||
| date = 2004-11-01 |
| date = 2004-11-01 |
||
| authors = Sylvain Lombardy, Yann Régis-Gianas, Jacques Sakarovitch |
| authors = Sylvain Lombardy, Yann Régis-Gianas, Jacques Sakarovitch |
||
Line 6: | Line 7: | ||
| volume = 328 |
| volume = 328 |
||
| pages = 77 to 96 |
| pages = 77 to 96 |
||
− | | project = Vaucanson |
||
− | | urllrde = 200411-TCS |
||
⚫ | | 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. |
||
| lrdeprojects = Vaucanson |
| lrdeprojects = Vaucanson |
||
⚫ | | 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. |
||
| type = article |
| type = article |
||
| id = lombardy.04.tcs |
| id = lombardy.04.tcs |
||
Line 22: | Line 21: | ||
pages = <nowiki>{</nowiki>77--96<nowiki>}</nowiki>, |
pages = <nowiki>{</nowiki>77--96<nowiki>}</nowiki>, |
||
month = nov, |
month = nov, |
||
− | project = <nowiki>{</nowiki>Vaucanson<nowiki>}</nowiki>, |
||
abstract = <nowiki>{</nowiki>This paper reports on a new software platform called |
abstract = <nowiki>{</nowiki>This paper reports on a new software platform called |
||
VAUCANSON and dedicated to the computation with automata |
VAUCANSON and dedicated to the computation with automata |
||
Line 35: | Line 33: | ||
the algorithm and finally explains the main choices of the |
the algorithm and finally explains the main choices of the |
||
programming design that enable to achieve both genericity |
programming design that enable to achieve both genericity |
||
− | and efficiency.<nowiki>}</nowiki> |
+ | and efficiency.<nowiki>}</nowiki> |
− | lrdeprojects = <nowiki>{</nowiki>Vaucanson<nowiki>}</nowiki> |
||
<nowiki>}</nowiki> |
<nowiki>}</nowiki> |
||
Latest revision as of 18:57, 4 January 2018
- Authors
- Sylvain Lombardy, Yann Régis-Gianas, Jacques Sakarovitch
- Journal
- Theoretical Computer Science
- Type
- article
- Projects
- Vaucanson
- Date
- 2004-11-01
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.} }