Introducing Vaucanson
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 shows how Vaucanson allows to progr...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 107 |
|---|---|
| container_issue | |
| container_start_page | 96 |
| container_title | |
| container_volume | 2759 |
| creator | Lombardy, Sylvain Poss, Raphaël Régis-Gianas, Yann Sakarovitch, Jacques |
| description | 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 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 weigh too much on the performance and finally explains the main choices of the programming design that enable to achieve both genericity and efficiency. |
| doi_str_mv | 10.1007/3-540-45089-0_10 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_15671229</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3072137_16_107</sourcerecordid><originalsourceid>FETCH-LOGICAL-p268t-276a68f0eab13111f9342bb7da087cf407c7ae70837a90ee95d04d13278b64043</originalsourceid><addsrcrecordid>eNpFUDtPwzAQNk8RlY5IjCyMKXe-OGePqOJRqRILsFqO45RCSUqcDvx73IfELSd9j9N9nxDXCBME4DvKVQF5oUCbHCzCkRgb1pTAHVYciwxLxJyoMCf_HKgS4VRkQCBzwwWdi8worSQoQxdiHOMnpEFmJJ2Jq1k79F298ct2cfPuNt61sWsvxVnjVjGMD3sk3h4fXqfP-fzlaTa9n-drWeohl1y6UjcQXIWEiI2hQlYV1w40-6YA9uwCgyZ2BkIwqoaiRpKsqzL9SiNxu7-7dtG7VdO71i-jXffLb9f_WlQlo5Qm6SZ7XUxUuwi9rbruK6ZW7LYrSzZFt7te7BZKBjoc7rufTYiDDVuHDymtW_kPtx5CHy0BSyS2WCYT0x9Lk2N5</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3072137_16_107</pqid></control><display><type>book_chapter</type><title>Introducing Vaucanson</title><source>Springer Books</source><creator>Lombardy, Sylvain ; Poss, Raphaël ; Régis-Gianas, Yann ; Sakarovitch, Jacques</creator><contributor>Dang, Zhe ; Ibarra, Oscar H ; Dang, Zhe ; Ibarra, Oscar H.</contributor><creatorcontrib>Lombardy, Sylvain ; Poss, Raphaël ; Régis-Gianas, Yann ; Sakarovitch, Jacques ; Dang, Zhe ; Ibarra, Oscar H ; Dang, Zhe ; Ibarra, Oscar H.</creatorcontrib><description>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 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 weigh too much on the performance and finally explains the main choices of the programming design that enable to achieve both genericity and efficiency.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540405610</identifier><identifier>ISBN: 3540405615</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540450894</identifier><identifier>EISBN: 3540450890</identifier><identifier>DOI: 10.1007/3-540-45089-0_10</identifier><identifier>OCLC: 958520593</identifier><identifier>LCCallNum: Q334-342</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Design Pattern ; Exact sciences and technology ; External Library ; Iterator Concept ; Rational Language ; Software ; Standard Template Library</subject><ispartof>Implementation and Application of Automata, 2003, Vol.2759, p.96-107</ispartof><rights>Springer-Verlag Berlin Heidelberg 2003</rights><rights>2004 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3072137-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3-540-45089-0_10$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3-540-45089-0_10$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15671229$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Dang, Zhe</contributor><contributor>Ibarra, Oscar H</contributor><contributor>Dang, Zhe</contributor><contributor>Ibarra, Oscar H.</contributor><creatorcontrib>Lombardy, Sylvain</creatorcontrib><creatorcontrib>Poss, Raphaël</creatorcontrib><creatorcontrib>Régis-Gianas, Yann</creatorcontrib><creatorcontrib>Sakarovitch, Jacques</creatorcontrib><title>Introducing Vaucanson</title><title>Implementation and Application of Automata</title><description>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 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 weigh too much on the performance and finally explains the main choices of the programming design that enable to achieve both genericity and efficiency.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Design Pattern</subject><subject>Exact sciences and technology</subject><subject>External Library</subject><subject>Iterator Concept</subject><subject>Rational Language</subject><subject>Software</subject><subject>Standard Template Library</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540405610</isbn><isbn>3540405615</isbn><isbn>9783540450894</isbn><isbn>3540450890</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2003</creationdate><recordtype>book_chapter</recordtype><recordid>eNpFUDtPwzAQNk8RlY5IjCyMKXe-OGePqOJRqRILsFqO45RCSUqcDvx73IfELSd9j9N9nxDXCBME4DvKVQF5oUCbHCzCkRgb1pTAHVYciwxLxJyoMCf_HKgS4VRkQCBzwwWdi8worSQoQxdiHOMnpEFmJJ2Jq1k79F298ct2cfPuNt61sWsvxVnjVjGMD3sk3h4fXqfP-fzlaTa9n-drWeohl1y6UjcQXIWEiI2hQlYV1w40-6YA9uwCgyZ2BkIwqoaiRpKsqzL9SiNxu7-7dtG7VdO71i-jXffLb9f_WlQlo5Qm6SZ7XUxUuwi9rbruK6ZW7LYrSzZFt7te7BZKBjoc7rufTYiDDVuHDymtW_kPtx5CHy0BSyS2WCYT0x9Lk2N5</recordid><startdate>2003</startdate><enddate>2003</enddate><creator>Lombardy, Sylvain</creator><creator>Poss, Raphaël</creator><creator>Régis-Gianas, Yann</creator><creator>Sakarovitch, Jacques</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2003</creationdate><title>Introducing Vaucanson</title><author>Lombardy, Sylvain ; Poss, Raphaël ; Régis-Gianas, Yann ; Sakarovitch, Jacques</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p268t-276a68f0eab13111f9342bb7da087cf407c7ae70837a90ee95d04d13278b64043</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Design Pattern</topic><topic>Exact sciences and technology</topic><topic>External Library</topic><topic>Iterator Concept</topic><topic>Rational Language</topic><topic>Software</topic><topic>Standard Template Library</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lombardy, Sylvain</creatorcontrib><creatorcontrib>Poss, Raphaël</creatorcontrib><creatorcontrib>Régis-Gianas, Yann</creatorcontrib><creatorcontrib>Sakarovitch, Jacques</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Lombardy, Sylvain</au><au>Poss, Raphaël</au><au>Régis-Gianas, Yann</au><au>Sakarovitch, Jacques</au><au>Dang, Zhe</au><au>Ibarra, Oscar H</au><au>Dang, Zhe</au><au>Ibarra, Oscar H.</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Introducing Vaucanson</atitle><btitle>Implementation and Application of Automata</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2003</date><risdate>2003</risdate><volume>2759</volume><spage>96</spage><epage>107</epage><pages>96-107</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540405610</isbn><isbn>3540405615</isbn><eisbn>9783540450894</eisbn><eisbn>3540450890</eisbn><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 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 weigh too much on the performance and finally explains the main choices of the programming design that enable to achieve both genericity and efficiency.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/3-540-45089-0_10</doi><oclcid>958520593</oclcid><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Implementation and Application of Automata, 2003, Vol.2759, p.96-107 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_15671229 |
| source | Springer Books |
| subjects | Applied sciences Computer science control theory systems Design Pattern Exact sciences and technology External Library Iterator Concept Rational Language Software Standard Template Library |
| title | Introducing Vaucanson |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T22%3A36%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Introducing%20Vaucanson&rft.btitle=Implementation%20and%20Application%20of%20Automata&rft.au=Lombardy,%20Sylvain&rft.date=2003&rft.volume=2759&rft.spage=96&rft.epage=107&rft.pages=96-107&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540405610&rft.isbn_list=3540405615&rft_id=info:doi/10.1007/3-540-45089-0_10&rft_dat=%3Cproquest_pasca%3EEBC3072137_16_107%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540450894&rft.eisbn_list=3540450890&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3072137_16_107&rft_id=info:pmid/&rfr_iscdi=true |