{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:23:07Z","timestamp":1776316987603,"version":"3.50.1"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2014,8,15]],"date-time":"2014-08-15T00:00:00Z","timestamp":1408060800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["239850"],"award-info":[{"award-number":["239850"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We study languages over infinite alphabets equipped with some structure that\ncan be tested by recognizing automata. We develop a framework for studying such\nalphabets and the ensuing automata theory, where the key role is played by an\nautomorphism group of the alphabet. In the process, we generalize nominal sets\ndue to Gabbay and Pitts.<\/jats:p>","DOI":"10.2168\/lmcs-10(3:4)2014","type":"journal-article","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T09:40:57Z","timestamp":1415958057000},"source":"Crossref","is-referenced-by-count":44,"title":["Automata theory in nominal sets"],"prefix":"10.46298","volume":"Volume 10, Issue 3","author":[{"given":"Miko\u0142aj","family":"Boja\u0144czyk","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5793-7425","authenticated-orcid":false,"given":"Bartek","family":"Klin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8674-4470","authenticated-orcid":false,"given":"S\u0142awomir","family":"Lasota","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2014,8,15]]},"reference":[{"key":"717:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1157\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1157\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:04:50Z","timestamp":1681243490000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,15]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-10(3:4)2014","relation":{"is-same-as":[{"id-type":"arxiv","id":"1402.0897","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1402.0897","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,15]]},"article-number":"1157"}}