Parikh's theorem for infinite alphabets
We investigate commutative images of languages recognised by register automata and grammars. Semi-linear and rational sets can be naturally extended to this setting by allowing for orbit-finite unions instead of only finite ones. We prove that commutative images of languages of one-register automata...
Uloženo v:
| Vydáno v: | Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science s. 1 - 13 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
29.06.2021
|
| Témata: | |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We investigate commutative images of languages recognised by register automata and grammars. Semi-linear and rational sets can be naturally extended to this setting by allowing for orbit-finite unions instead of only finite ones. We prove that commutative images of languages of one-register automata are not always semi-linear, but they are always rational. We also lift the latter result to grammars: commutative images of one- register context-free languages are rational, and in consequence commutatively equivalent to register automata. We conjecture analogous results for automata and grammars with arbitrarily many registers. |
|---|---|
| AbstractList | We investigate commutative images of languages recognised by register automata and grammars. Semi-linear and rational sets can be naturally extended to this setting by allowing for orbit-finite unions instead of only finite ones. We prove that commutative images of languages of one-register automata are not always semi-linear, but they are always rational. We also lift the latter result to grammars: commutative images of one- register context-free languages are rational, and in consequence commutatively equivalent to register automata. We conjecture analogous results for automata and grammars with arbitrarily many registers. |
| Author | Lasota, Slawomir Juzepczuk, Marta Pattathurajan, Mohnish Hofman, Piotr |
| Author_xml | – sequence: 1 givenname: Piotr surname: Hofman fullname: Hofman, Piotr organization: University of Warsaw – sequence: 2 givenname: Marta surname: Juzepczuk fullname: Juzepczuk, Marta organization: University of Warsaw – sequence: 3 givenname: Slawomir surname: Lasota fullname: Lasota, Slawomir organization: University of Warsaw – sequence: 4 givenname: Mohnish surname: Pattathurajan fullname: Pattathurajan, Mohnish organization: University of Warsaw |
| BookMark | eNotj01LxDAQQCMoqGt_gSC97al1Mk0ymaMUPxYKCup5SbcTGt1tl7YX_72Ie3q8y4N3rc6HcRCl7jSUWgPfN5v63SI6UyKgLtkQOHRnKmPy2jlrjGfrLlU2z18AgJ40GL5S67cwpe9-PedLL-MkhzyOU56GmIa0SB72xz60ssw36iKG_SzZiSv1-fT4Ub8Uzevzpn5oioCel8ISt448h85ilEDRQCcYtCfZdaZqK-cJI_wp-cieKVjAHSKTASdcrdTtfzeJyPY4pUOYfranneoXKl1BVA |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/LICS52264.2021.9470626 |
| 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: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9781665448956 1665448954 |
| EndPage | 13 |
| ExternalDocumentID | 9470626 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IH ACM ALMA_UNASSIGNED_HOLDINGS APO CBEJK GUFHI LHSKQ RIE RIO |
| ID | FETCH-LOGICAL-a289t-579b6789ad52fea7f40de2a187ecd43b36872f087ec78f9897a502c2297406e93 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000947350400049&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:23:08 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a289t-579b6789ad52fea7f40de2a187ecd43b36872f087ec78f9897a502c2297406e93 |
| PageCount | 13 |
| ParticipantIDs | ieee_primary_9470626 |
| 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.1978621 |
| Snippet | We investigate commutative images of languages recognised by register automata and grammars. Semi-linear and rational sets can be naturally extended to this... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Automata Computer science Grammar Image recognition Orbits Registers |
| Title | Parikh's theorem for infinite alphabets |
| URI | https://ieeexplore.ieee.org/document/9470626 |
| WOSCitedRecordID | wos000947350400049&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/eLvHCXMwlV1LSwMxEB7a4sFT1Va0PshB6MVts0k2j3OxKEgpqNBbySazWMRW2q2_32S7VgQv3pJACJNkmG8m82UAbgRzGc-8TjBTRSK41YnWMk-cVC51uRNBpapiE2oy0bOZmTbgds-FQcQq-QwHsVm95fuV28ZQ2dAIRQMAb0JTKbnjau3jKRH5B7Rbk4BTaoaPD6OniC5i5ISlg3ryryoqlREZt_-3_BF0f9h4ZLq3M8fQwOUJtL_LMZBaOzvQnwa_9-21vyE7duI7CYCUhBu0iLiSVKzaHMtNF17Gd8-j-6Sug5DY4A6VSaZMHmyKsT5jBVpVCOqR2VQrdF7wnEutWEFjV-nCaKNsRpljLPgKVKLhp9BarpZ4BsTmmhcekapgunkqDVLug08lUEpmsDiHTpR7_rH76mJei9z7e_gCDuPWxswpZi6hVa63eAUH7rNcbNbX1fl8AQy0j9k |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEJ0gmugJFYzf7sGEi4Vu2922ZyKBiIRETLiRbnc2EiIYWPz9tsuKMfHirW3SpJ-ZN9N5fQD3gtmIR6kiGMmMCG4UUSpOiI2lDW1ihbtShdiEHA7VZKJHFXjYcWEQsUg-w5YvFm_56dJufKisrYWkDoDvwb5XzirZWruIisf-Du-WNOCQ6vag33nx-MLHTljYKrv_0lEpzEi39r8BHEPjh48XjHaW5gQquDiF2rcgQ1Dezzo0R87znb8118GWn_geOEgauDM088gyKHi1CebrBrx2H8edHimVEIhxDlFOIqkTZ1W0SSOWoZGZoCkyEyqJNhU84bGSLKO-KlWmlZYmoswy5rwFGqPmZ1BdLBd4DoFJFM9SRCqd8eZhrJHy1HlVAuOYacwuoO7nPf3YfnYxLad8-XfzHRz2xs-D6aA_fLqCI7_MPo-K6Wuo5qsN3sCB_cxn69VtsVdfwICTIg |
| 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=Parikh%27s+theorem+for+infinite+alphabets&rft.au=Hofman%2C+Piotr&rft.au=Juzepczuk%2C+Marta&rft.au=Lasota%2C+Slawomir&rft.au=Pattathurajan%2C+Mohnish&rft.date=2021-06-29&rft.pub=IEEE&rft.spage=1&rft.epage=13&rft_id=info:doi/10.1109%2FLICS52264.2021.9470626&rft.externalDocID=9470626 |