Squaring transducers: an efficient procedure for deciding functionality and sequentiality
We describe here a construction on transducers that give a new conceptual proof for two classical decidability results on transducers: it is decidable whether a finite transducer realizes a functional relation, and whether a finite transducer realizes a sequential relation. A better complexity follo...
Gespeichert in:
| Veröffentlicht in: | Theoretical computer science 2003-01, Vol.292 (1), p.45-63 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 63 |
|---|---|
| container_issue | 1 |
| container_start_page | 45 |
| container_title | Theoretical computer science |
| container_volume | 292 |
| creator | Béal, Marie-Pierre Carton, Olivier Prieur, Christophe Sakarovitch, Jacques |
| description | We describe here a construction on transducers that give a new conceptual proof for two classical decidability results on transducers: it is decidable whether a finite transducer realizes a functional relation, and whether a finite transducer realizes a sequential relation. A better complexity follows then for the two decision procedures.
e papier présente une construction sur les transducteurs qui donne une nouvelle preuve conceptuelle pour deux résultats classiques de décidabilité sur les transducteurs: on peut décider si un transducteur fini réalise une relation fonctionnelle et s'il réalise une relation séquentielle. Il en résulte un algorithme polynomial pour les deux procédures de décision. |
| doi_str_mv | 10.1016/S0304-3975(01)00214-6 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_00619218v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0304397501002146</els_id><sourcerecordid>27985803</sourcerecordid><originalsourceid>FETCH-LOGICAL-c402t-a1821848bc6f7855bcd6d30656678121a29057f6a12221937b2b5ea13a9408f93</originalsourceid><addsrcrecordid>eNqFkE9LwzAYh4MoOKcfQehFcYdq3rRNEy8yhjph4GF68BTSNNFI125JO9i3N12HHs0l8PL83j8PQpeAbwEDvVviBKdxwvPsBsMEYwJpTI_QCFjOY0J4eoxGv8gpOvP-G4eX5XSEPpabTjpbf0atk7UvO6Wdv49kHWljrLK6bqO1a5QuO6cj07io1MqWfcB0tWptU8vKtruQKCOvN10I2H3lHJ0YWXl9cfjH6P3p8W02jxevzy-z6SJWKSZtLIERYCkrFDU5y7JClbRMMM0ozRkQkISHTQ2VQAgBnuQFKTItIZE8xczwZIwmQ98vWYm1syvpdqKRVsynC9HXMKbAw4wtBPZ6YMNJYVXfipX1SleVrHXTeUFyzjKGkwBmA6hc473T5rczYNFLF3vpojcqMIi9dEFD7uowQHolKxOcKuv_wmm4GSgL3MPA6WBma7UTvncdNFunVSvKxv4z6QerX5Un</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>27985803</pqid></control><display><type>article</type><title>Squaring transducers: an efficient procedure for deciding functionality and sequentiality</title><source>ScienceDirect Journals (5 years ago - present)</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Béal, Marie-Pierre ; Carton, Olivier ; Prieur, Christophe ; Sakarovitch, Jacques</creator><creatorcontrib>Béal, Marie-Pierre ; Carton, Olivier ; Prieur, Christophe ; Sakarovitch, Jacques</creatorcontrib><description>We describe here a construction on transducers that give a new conceptual proof for two classical decidability results on transducers: it is decidable whether a finite transducer realizes a functional relation, and whether a finite transducer realizes a sequential relation. A better complexity follows then for the two decision procedures.
e papier présente une construction sur les transducteurs qui donne une nouvelle preuve conceptuelle pour deux résultats classiques de décidabilité sur les transducteurs: on peut décider si un transducteur fini réalise une relation fonctionnelle et s'il réalise une relation séquentielle. Il en résulte un algorithme polynomial pour les deux procédures de décision.</description><identifier>ISSN: 0304-3975</identifier><identifier>EISSN: 1879-2294</identifier><identifier>DOI: 10.1016/S0304-3975(01)00214-6</identifier><identifier>CODEN: TCSCDI</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Applied sciences ; Automata. Abstract machines. Turing machines ; Computer Science ; Computer science; control theory; systems ; Data Structures and Algorithms ; Exact sciences and technology ; Finite automata ; Functional transducer ; Sequential transducer ; Theoretical computing</subject><ispartof>Theoretical computer science, 2003-01, Vol.292 (1), p.45-63</ispartof><rights>2002 Elsevier Science B.V.</rights><rights>2003 INIST-CNRS</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c402t-a1821848bc6f7855bcd6d30656678121a29057f6a12221937b2b5ea13a9408f93</citedby><cites>FETCH-LOGICAL-c402t-a1821848bc6f7855bcd6d30656678121a29057f6a12221937b2b5ea13a9408f93</cites><orcidid>0000-0002-2728-6534 ; 0000-0002-4456-2019</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/S0304-3975(01)00214-6$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>230,314,780,784,885,3548,27923,27924,45994</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=14402168$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://hal.science/hal-00619218$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Béal, Marie-Pierre</creatorcontrib><creatorcontrib>Carton, Olivier</creatorcontrib><creatorcontrib>Prieur, Christophe</creatorcontrib><creatorcontrib>Sakarovitch, Jacques</creatorcontrib><title>Squaring transducers: an efficient procedure for deciding functionality and sequentiality</title><title>Theoretical computer science</title><description>We describe here a construction on transducers that give a new conceptual proof for two classical decidability results on transducers: it is decidable whether a finite transducer realizes a functional relation, and whether a finite transducer realizes a sequential relation. A better complexity follows then for the two decision procedures.
e papier présente une construction sur les transducteurs qui donne une nouvelle preuve conceptuelle pour deux résultats classiques de décidabilité sur les transducteurs: on peut décider si un transducteur fini réalise une relation fonctionnelle et s'il réalise une relation séquentielle. Il en résulte un algorithme polynomial pour les deux procédures de décision.</description><subject>Applied sciences</subject><subject>Automata. Abstract machines. Turing machines</subject><subject>Computer Science</subject><subject>Computer science; control theory; systems</subject><subject>Data Structures and Algorithms</subject><subject>Exact sciences and technology</subject><subject>Finite automata</subject><subject>Functional transducer</subject><subject>Sequential transducer</subject><subject>Theoretical computing</subject><issn>0304-3975</issn><issn>1879-2294</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><recordid>eNqFkE9LwzAYh4MoOKcfQehFcYdq3rRNEy8yhjph4GF68BTSNNFI125JO9i3N12HHs0l8PL83j8PQpeAbwEDvVviBKdxwvPsBsMEYwJpTI_QCFjOY0J4eoxGv8gpOvP-G4eX5XSEPpabTjpbf0atk7UvO6Wdv49kHWljrLK6bqO1a5QuO6cj07io1MqWfcB0tWptU8vKtruQKCOvN10I2H3lHJ0YWXl9cfjH6P3p8W02jxevzy-z6SJWKSZtLIERYCkrFDU5y7JClbRMMM0ozRkQkISHTQ2VQAgBnuQFKTItIZE8xczwZIwmQ98vWYm1syvpdqKRVsynC9HXMKbAw4wtBPZ6YMNJYVXfipX1SleVrHXTeUFyzjKGkwBmA6hc473T5rczYNFLF3vpojcqMIi9dEFD7uowQHolKxOcKuv_wmm4GSgL3MPA6WBma7UTvncdNFunVSvKxv4z6QerX5Un</recordid><startdate>20030110</startdate><enddate>20030110</enddate><creator>Béal, Marie-Pierre</creator><creator>Carton, Olivier</creator><creator>Prieur, Christophe</creator><creator>Sakarovitch, Jacques</creator><general>Elsevier B.V</general><general>Elsevier</general><scope>6I.</scope><scope>AAFTH</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>1XC</scope><orcidid>https://orcid.org/0000-0002-2728-6534</orcidid><orcidid>https://orcid.org/0000-0002-4456-2019</orcidid></search><sort><creationdate>20030110</creationdate><title>Squaring transducers: an efficient procedure for deciding functionality and sequentiality</title><author>Béal, Marie-Pierre ; Carton, Olivier ; Prieur, Christophe ; Sakarovitch, Jacques</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c402t-a1821848bc6f7855bcd6d30656678121a29057f6a12221937b2b5ea13a9408f93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Applied sciences</topic><topic>Automata. Abstract machines. Turing machines</topic><topic>Computer Science</topic><topic>Computer science; control theory; systems</topic><topic>Data Structures and Algorithms</topic><topic>Exact sciences and technology</topic><topic>Finite automata</topic><topic>Functional transducer</topic><topic>Sequential transducer</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Béal, Marie-Pierre</creatorcontrib><creatorcontrib>Carton, Olivier</creatorcontrib><creatorcontrib>Prieur, Christophe</creatorcontrib><creatorcontrib>Sakarovitch, Jacques</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Hyper Article en Ligne (HAL)</collection><jtitle>Theoretical computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Béal, Marie-Pierre</au><au>Carton, Olivier</au><au>Prieur, Christophe</au><au>Sakarovitch, Jacques</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Squaring transducers: an efficient procedure for deciding functionality and sequentiality</atitle><jtitle>Theoretical computer science</jtitle><date>2003-01-10</date><risdate>2003</risdate><volume>292</volume><issue>1</issue><spage>45</spage><epage>63</epage><pages>45-63</pages><issn>0304-3975</issn><eissn>1879-2294</eissn><coden>TCSCDI</coden><abstract>We describe here a construction on transducers that give a new conceptual proof for two classical decidability results on transducers: it is decidable whether a finite transducer realizes a functional relation, and whether a finite transducer realizes a sequential relation. A better complexity follows then for the two decision procedures.
e papier présente une construction sur les transducteurs qui donne une nouvelle preuve conceptuelle pour deux résultats classiques de décidabilité sur les transducteurs: on peut décider si un transducteur fini réalise une relation fonctionnelle et s'il réalise une relation séquentielle. Il en résulte un algorithme polynomial pour les deux procédures de décision.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/S0304-3975(01)00214-6</doi><tpages>19</tpages><orcidid>https://orcid.org/0000-0002-2728-6534</orcidid><orcidid>https://orcid.org/0000-0002-4456-2019</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0304-3975 |
| ispartof | Theoretical computer science, 2003-01, Vol.292 (1), p.45-63 |
| issn | 0304-3975 1879-2294 |
| language | eng |
| recordid | cdi_hal_primary_oai_HAL_hal_00619218v1 |
| source | ScienceDirect Journals (5 years ago - present); EZB-FREE-00999 freely available EZB journals |
| subjects | Applied sciences Automata. Abstract machines. Turing machines Computer Science Computer science control theory systems Data Structures and Algorithms Exact sciences and technology Finite automata Functional transducer Sequential transducer Theoretical computing |
| title | Squaring transducers: an efficient procedure for deciding functionality and sequentiality |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T22%3A24%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Squaring%20transducers:%20an%20efficient%20procedure%20for%20deciding%20functionality%20and%20sequentiality&rft.jtitle=Theoretical%20computer%20science&rft.au=B%C3%A9al,%20Marie-Pierre&rft.date=2003-01-10&rft.volume=292&rft.issue=1&rft.spage=45&rft.epage=63&rft.pages=45-63&rft.issn=0304-3975&rft.eissn=1879-2294&rft.coden=TCSCDI&rft_id=info:doi/10.1016/S0304-3975(01)00214-6&rft_dat=%3Cproquest_hal_p%3E27985803%3C/proquest_hal_p%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=27985803&rft_id=info:pmid/&rft_els_id=S0304397501002146&rfr_iscdi=true |