SD-Regular Transducer Expressions for Aperiodic Transformations
FO transductions, aperiodic deterministic two-way transducers, as well as aperiodic streaming string transducers are all equivalent models for first order definable functions. In this paper, we solve the problem of expressions capturing first order definable functions, thereby generalizing the semin...
Saved in:
| Published in: | Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 13 |
|---|---|
| Main Authors: | , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
29.06.2021
|
| Subjects: | |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | FO transductions, aperiodic deterministic two-way transducers, as well as aperiodic streaming string transducers are all equivalent models for first order definable functions. In this paper, we solve the problem of expressions capturing first order definable functions, thereby generalizing the seminal SF=AP (star-free expressions = aperiodic languages) result of Schützenberger. Our result also generalizes a lesser known characterization by Schutzenberger of aperiodic languages by SD-regular expressions (SD=AP). We show that every first order definable function over finite words captured by an aperiodic deterministic two-way transducer can be described with an SD-regular transducer expression (SDRTE). An SDRTE is a regular expression where Kleene stars are used in a restricted way: they can appear only on aperiodic languages which are prefix codes of bounded synchronization delay. SDRTEs are constructed from simple functions using the combinators unambiguous sum (deterministic choice), Hadamard product, and unambiguous versions of the Cauchy product and the fc-chained Kleene-star, where the star is restricted as mentioned. In order to construct an SDRTE associated with an aperiodic deterministic two-way transducer, (i) we concretize Schutzenberger's SD=AP result, by proving that aperiodic languages are captured by SD-regular expressions which are unambiguous and stabilising; (ii) by structural induction on the unambiguous, stabilising SD-regular expressions describing the domain of the transducer, we construct SDRTEs. Finally, we also look at various formalisms equivalent to SDRTEs which use the function composition, allowing to trade the fc-chained star for a 1-star. |
|---|---|
| AbstractList | FO transductions, aperiodic deterministic two-way transducers, as well as aperiodic streaming string transducers are all equivalent models for first order definable functions. In this paper, we solve the problem of expressions capturing first order definable functions, thereby generalizing the seminal SF=AP (star-free expressions = aperiodic languages) result of Schützenberger. Our result also generalizes a lesser known characterization by Schutzenberger of aperiodic languages by SD-regular expressions (SD=AP). We show that every first order definable function over finite words captured by an aperiodic deterministic two-way transducer can be described with an SD-regular transducer expression (SDRTE). An SDRTE is a regular expression where Kleene stars are used in a restricted way: they can appear only on aperiodic languages which are prefix codes of bounded synchronization delay. SDRTEs are constructed from simple functions using the combinators unambiguous sum (deterministic choice), Hadamard product, and unambiguous versions of the Cauchy product and the fc-chained Kleene-star, where the star is restricted as mentioned. In order to construct an SDRTE associated with an aperiodic deterministic two-way transducer, (i) we concretize Schutzenberger's SD=AP result, by proving that aperiodic languages are captured by SD-regular expressions which are unambiguous and stabilising; (ii) by structural induction on the unambiguous, stabilising SD-regular expressions describing the domain of the transducer, we construct SDRTEs. Finally, we also look at various formalisms equivalent to SDRTEs which use the function composition, allowing to trade the fc-chained star for a 1-star. |
| Author | Dartois, Luc Krishna, Shankara Narayanan Gastin, Paul |
| Author_xml | – sequence: 1 givenname: Luc surname: Dartois fullname: Dartois, Luc email: luc.dartois@lacl.fr organization: Univ Paris Est Creteil,LACL,Creteil,France,F-94010 – sequence: 2 givenname: Paul surname: Gastin fullname: Gastin, Paul email: paul.gastin@lsv.fr organization: Université Paris-Saclay,ENS Paris-Saclay, CNRS, LMF,Gif-sur-Yvette,France,91190 – sequence: 3 givenname: Shankara Narayanan surname: Krishna fullname: Krishna, Shankara Narayanan email: krishnas@cse.iitb.ac.in organization: IIT Bombay,Dept. Computer Science and Engineering,India |
| BookMark | eNotj1FLwzAUhSMoqLO_QJD-gdbk5jbJfZIxNx0UBDefR7IkUtnakmyg_15lezpwvsMH55Zd9kMfGHsQvBaC02O7nK0aAIU1cBA1oeZamgtWkDZCqQbRUKOuWZHzF-ccjBYc6YY9rZ6r9_B53NlUrpPtsz9uQyrn32MKOXdDn8s4pHI6htQNvtueRn_V3h7-6R27inaXQ3HOCftYzNez16p9e1nOpm1lJchDhRAcRm0aiMJE8FIpi04S19FYKxUCOSQD3hE50BYEKh-dF9qQB-XkhN2fvF0IYTOmbm_Tz-Z8U_4COxlK1w |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/LICS52264.2021.9470738 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEL url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9781665448956 1665448954 |
| EndPage | 13 |
| ExternalDocumentID | 9470738 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IH ACM ALMA_UNASSIGNED_HOLDINGS APO CBEJK GUFHI LHSKQ RIE RIO |
| ID | FETCH-LOGICAL-a323t-42eb4f7852f18f2d366a4b3907f8aa36429b4982db99b27a2146dfbd1789d26b3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000947350400088&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:26:37 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a323t-42eb4f7852f18f2d366a4b3907f8aa36429b4982db99b27a2146dfbd1789d26b3 |
| OpenAccessLink | https://hal.science/hal-03283013 |
| PageCount | 13 |
| ParticipantIDs | ieee_primary_9470738 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-June-29 |
| PublicationDateYYYYMMDD | 2021-06-29 |
| PublicationDate_xml | – month: 06 year: 2021 text: 2021-June-29 day: 29 |
| PublicationDecade | 2020 |
| PublicationTitle | Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science |
| PublicationTitleAbbrev | LICS |
| PublicationYear | 2021 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0002871049 |
| Score | 2.198013 |
| Snippet | FO transductions, aperiodic deterministic two-way transducers, as well as aperiodic streaming string transducers are all equivalent models for first order... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Complexity theory Computer science Delays Synchronization Time complexity Transducers |
| Title | SD-Regular Transducer Expressions for Aperiodic Transformations |
| URI | https://ieeexplore.ieee.org/document/9470738 |
| WOSCitedRecordID | wos000947350400088&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA5t8eCpaiu-2YNH0-4m2TyOUlsUpBQf0FtJdhLoZSvbB_58k3RdEbx4CyEhMEmYbybz5UPoVttMO5UZ7N05x4znBps8ddha7k8QsFyAi2ITYjqV87matdBdw4Wx1sbiMzsIzfiWD6tiG1JlQ8WEP5GyjdpC8D1Xq8mnBOTv0W5NAs5SNXx-Gr0GdBEyJyQb1JN_qahEJzLp_m_5I9T_YeMls8bPHKOWLU9Q91uOIalvZ8_j7gf8EqXlqyS6IPDbViXjz7rWtVwnHqEm9-Fv4xUsi_2ghr247qP3yfht9IhrfQSsKaEbzIg1zAmZE5dJR4ByrpmhPtx1UmvqIwtlmJIEjFKGCB00vMEZyIRUQLihp6hTrkp7hpLUpoUPNag2EDSouYYcHGW6MEA0pPYc9YI9Fh_7LzAWtSku_u6-RIfB5KGiiqgr1NlUW3uNDordZrmubuK-fQFro5n2 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEJ0gmugJFYzf7sGjhd22-9GjQQhEJEQx4UbanTbhspAFjD_fdlnXmHjx1jRt0kzbzJvpvD6Ae6kDaUSgiHXnEeFRqIgKfUO0juwJQh7GaAqxiXg8TmYzManBQ8WF0VoXxWe67ZrFWz4u061LlXUEj-2JTPZg3ylnlWytKqPisL_FuyUNOPBFZzTsvjl84XInNGiX03_pqBRupN_43wKOofXDx_Mmlac5gZrOTqHxLcjglfezaZH3E3ktxOVzr3BCaDcu93qfZbVrtvYsRvUe3e_GS1yku0EVf3Hdgvd-b9odkFIhgUhG2YZwqhU3cRJSEySGIosiyRWzAa9JpGQ2thCKi4SiEkLRWDoVbzQKgzgRSCPFzqCeLTN9Dp6v_dQGG0wqdCrUkcQQDeMyVUgl-voCms4e89XuE4x5aYrLv7vv4HAwfRnNR8Px8xUcOfO7-ioqrqG-ybf6Bg7Sj81ind8We_gFoVidPw |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+36th+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science&rft.atitle=SD-Regular+Transducer+Expressions+for+Aperiodic+Transformations&rft.au=Dartois%2C+Luc&rft.au=Gastin%2C+Paul&rft.au=Krishna%2C+Shankara+Narayanan&rft.date=2021-06-29&rft.pub=IEEE&rft.spage=1&rft.epage=13&rft_id=info:doi/10.1109%2FLICS52264.2021.9470738&rft.externalDocID=9470738 |