Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
We develop a theory of vector spaces spanned by orbit-finite sets. Using this theory, we give a decision procedure for equivalence of weighted register automata, which are the common generalization of weighted automata and register automata for infinite alphabets. The algorithm runs in exponential t...
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 | We develop a theory of vector spaces spanned by orbit-finite sets. Using this theory, we give a decision procedure for equivalence of weighted register automata, which are the common generalization of weighted automata and register automata for infinite alphabets. The algorithm runs in exponential time, and in polynomial time for a fixed number of registers. As a special case, we can decide, with the same complexity, language equivalence for unambiguous register automata, which improves previous results in three ways: (a) we allow for order comparisons on atoms, and not just equality; (b) the complexity is exponentially better; and (c) we allow automata with guessing. |
|---|---|
| AbstractList | We develop a theory of vector spaces spanned by orbit-finite sets. Using this theory, we give a decision procedure for equivalence of weighted register automata, which are the common generalization of weighted automata and register automata for infinite alphabets. The algorithm runs in exponential time, and in polynomial time for a fixed number of registers. As a special case, we can decide, with the same complexity, language equivalence for unambiguous register automata, which improves previous results in three ways: (a) we allow for order comparisons on atoms, and not just equality; (b) the complexity is exponentially better; and (c) we allow automata with guessing. |
| Author | Klin, Bartek Moerman, Joshua Bojanczyk, Mikolaj |
| Author_xml | – sequence: 1 givenname: Mikolaj surname: Bojanczyk fullname: Bojanczyk, Mikolaj email: bojan@mimuw.edu.pl organization: University of Warsaw – sequence: 2 givenname: Bartek surname: Klin fullname: Klin, Bartek email: klin@mimuw.edu.pl organization: University of Warsaw – sequence: 3 givenname: Joshua surname: Moerman fullname: Moerman, Joshua email: joshua@cs.rwth-aachen.de organization: RWTH Aachen |
| BookMark | eNotz8tKw0AUgOERFNSaJxAkL5A4t8zkLEtstRAoWC_LMpeTOtJMSmZc-PYu7OrfffDfkss4RSTkgdGaMQqP_abbNZwrWXPKWQ1SUyXkBSlAt0ypRsoWGnVNipS-KaW81YxKuCGr7WxDrtYhhozVUxgxpjBFcyw_0OVpLncn4zCVJvryE8PhK6MvX_EQUsa5XP7kaTTZ3JGrwRwTFucuyPt69da9VP32edMt-8rwFnJlxGA1FeBkg84joGfWWulQe28UKgMOsWVArWBMGAnAwWrhoQE6IFKxIPf_bkDE_WkOo5l_9-dZ8QdsCk3g |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/LICS52264.2021.9470634 |
| 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 | 9470634 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IH ACM ALMA_UNASSIGNED_HOLDINGS APO CBEJK GUFHI LHSKQ RIE RIO |
| ID | FETCH-LOGICAL-a289t-a3fb7039c45ecde9ed1bbb4ce7dda6e6a9cee8190b3113a49929b73d9590fee03 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 7 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000947350400053&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 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a289t-a3fb7039c45ecde9ed1bbb4ce7dda6e6a9cee8190b3113a49929b73d9590fee03 |
| PageCount | 13 |
| ParticipantIDs | ieee_primary_9470634 |
| 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.2673776 |
| Snippet | We develop a theory of vector spaces spanned by orbit-finite sets. Using this theory, we give a decision procedure for equivalence of weighted register... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Automata Complexity theory Computer science Orbits Registers Space vehicles |
| Title | Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata |
| URI | https://ieeexplore.ieee.org/document/9470634 |
| WOSCitedRecordID | wos000947350400053&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/eLvHCXMwlV07T8MwED61FQNTgRbxlgdG3MZOGtcjKq1AQqWiPLpVfpylLmkVUn4_dhKKkFjYrEh2orPO9_nLfXcA15HwPmNQUJ5yTRORIlXOH4Y8wGPUQkpRNZsQ0-lwsZCzBtzstDCIWCafYS8My3_5dm22gSrry0T4iJo0oSlEWmm1dnxKQP4e7dYiYBbJ_uPDaB7QRWBOOOvVk391USmDyKT9v9cfQPdHjUdmuzhzCA3MjqD93Y6B1N7ZgfFTrlcFnawCjKR3oWx_VXKDvJXUPJlvQv4VUZkl7yUjipY8Y1AA-WVut8Xao1fVhdfJ-GV0T-suCVT5y1JBVey0d1tpkgEaixIt01on3v7WqhRTJf33hbivY8Zi5W84XGoRWzmQkUOM4mNoZesMT4B4bCjQpI4pJhMPbaQzw0h5gOeGVnHhTqETrLLcVIUwlrVBzv5-fA77wfAhr4rLC2gV-RYvYc98FquP_KrcvS__q5vd |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH5BNNETKhh_24NHC1tXVno0CIGISASVG2nXt2SXQXD499tuE2PixVvTpEvTl7f39ev73gO49YT1mQgFZSHTlIsQqYrtz5A5eIxaSCmKZhNiPO7M53JSgbutFgYR8-QzbLph_pZvltHGUWUtyYWNqHwHdtucM69Qa20ZFYf9Ld4tZcC-J1ujYXfq8IXjTpjfLJf_6qOSh5F-7X8bOITGjx6PTLaR5ggqmB5D7bshAyn9sw6957VOMtpPHJCkD65wf1F0g7zl5DyZrlwGFlGpIe85J4qGvKDTANnP3G-ypcWvqgGv_d6sO6BlnwSq7HUpoyqItXVcGfE2RgYlGl9rza0FjFEhhkra_bnIrwPfD5S94zCpRWBkW3oxohecQDVdpngKxKJDgVEY-8qX3IIbGUcdT1mIF3eMYiI-g7o7lcWqKIWxKA_k_O_pG9gfzJ5Gi9Fw_HgBB84ILsuKyUuoZusNXsFe9JklH-vr3JJfSiifJA |
| 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=Orbit-Finite-Dimensional+Vector+Spaces+and+Weighted+Register+Automata&rft.au=Bojanczyk%2C+Mikolaj&rft.au=Klin%2C+Bartek&rft.au=Moerman%2C+Joshua&rft.date=2021-06-29&rft.pub=IEEE&rft.spage=1&rft.epage=13&rft_id=info:doi/10.1109%2FLICS52264.2021.9470634&rft.externalDocID=9470634 |