{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:22:12Z","timestamp":1751660532050,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,29]]},"DOI":"10.1109\/lics52264.2021.9470626","type":"proceedings-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T20:14:07Z","timestamp":1625688847000},"page":"1-13","source":"Crossref","is-referenced-by-count":2,"title":["Parikh\u2019s theorem for infinite alphabets"],"prefix":"10.1109","author":[{"given":"Piotr","family":"Hofman","sequence":"first","affiliation":[{"name":"University of Warsaw"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marta","family":"Juzepczuk","sequence":"additional","affiliation":[{"name":"University of Warsaw"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Slawomir","family":"Lasota","sequence":"additional","affiliation":[{"name":"University of Warsaw"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohnish","family":"Pattathurajan","sequence":"additional","affiliation":[{"name":"University of Warsaw"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2011.09.030"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/321356.321364"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00105-X"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1013560.1013562"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00246-9"},{"key":"ref15","first-page":"105","article-title":"Data monoids","volume":"9","author":"boja?czyk","year":"2011","journal-title":"Proc STACS 2011"},{"key":"ref16","article-title":"Logics with rigidly guarded data tests","volume":"11","author":"colcombet","year":"2015","journal-title":"Log Methods Comput Sci"},{"key":"ref17","first-page":"113:1","article-title":"Single-use automata and transducers for infinite alphabets","volume":"168","author":"boja?czyk","year":"2020","journal-title":"Proc ICALP 2020"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1507244.1507246"},{"key":"ref19","first-page":"267","article-title":"Generalized data automata and fixpoint logic","volume":"29","author":"colcombet","year":"2014","journal-title":"Proc FSTTCS 2014"},{"key":"ref4","article-title":"Slightly infinite sets","author":"boja?czyk","year":"0","journal-title":"Draft of a book"},{"key":"ref3","article-title":"Automata theory in nominal sets","volume":"10","author":"boja?czyk","year":"2014","journal-title":"Log Methods Comput Sci"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2015.03.005"},{"key":"ref5","first-page":"301","article-title":"Regular expressions for languages over infinite alphabets","volume":"69","author":"kaminski","year":"2006","journal-title":"Fund Informaticae"},{"key":"ref8","first-page":"355","article-title":"Automata with group actions","author":"boja?czyk","year":"2011","journal-title":"Proc LICS 2011"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28729-9_17"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/11874683_3"},{"key":"ref9","first-page":"495","article-title":"Une condition suffisante d'existence d'un circuit hamiltonien","volume":"25","author":"ghouila-houri","year":"1960","journal-title":"C R Acad Sci Paris"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","article-title":"Finite-memory automata","volume":"134","author":"francez","year":"1994","journal-title":"Theor Com-put Sci"},{"key":"ref20","first-page":"244","article-title":"Reachability analysis of first-order definable pushdown systems","volume":"41","author":"clemente","year":"2015","journal-title":"Proc CSL 2015"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(02)00030-2"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535849"},{"key":"ref24","article-title":"An extension of data automata that captures XPath","volume":"8","author":"boja?czyk","year":"2012","journal-title":"Log Methods Comput Sci"},{"key":"ref23","first-page":"27:1","article-title":"Two-variable logic on data words","volume":"12","author":"boja?czyk","year":"2011","journal-title":"ACM Trans Comput Log"},{"journal-title":"Automata Languages and Machines","year":"1974","author":"eilenberg","key":"ref26"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139084673","volume":"57","author":"pitts","year":"2013","journal-title":"Nominal Sets Names and Symmetry in Computer Science"}],"event":{"name":"2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2021,6,29]]},"location":"Rome, Italy","end":{"date-parts":[[2021,7,2]]}},"container-title":["2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9470497\/9470501\/09470626.pdf?arnumber=9470626","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T23:01:54Z","timestamp":1659481314000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9470626\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/lics52264.2021.9470626","relation":{},"subject":[],"published":{"date-parts":[[2021,6,29]]}}}