{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T19:10:14Z","timestamp":1648840214098},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2018,2]]},"abstract":"<jats:p> Two models of automata over infinite alphabets are presented, mainly with a focus on the alphabet [Formula: see text]. In the first model, transitions can refer to logic formulas that connect properties of successive letters. In the second, the letters are considered as columns of a labeled grid which an automaton traverses column by column. Thus, both models focus on the comparison of successive letters, i.e.\u00a0\u201clocal changes\u201d. We prove closure (and non-closure) properties, show the decidability of the respective non-emptiness problems, prove limits on decidability results for extended models, and discuss open issues in the development of a generalized theory. <\/jats:p>","DOI":"10.1142\/s012905411840004x","type":"journal-article","created":{"date-parts":[[2018,4,11]],"date-time":"2018-04-11T07:34:45Z","timestamp":1523432085000},"page":"213-231","source":"Crossref","is-referenced-by-count":0,"title":["Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change"],"prefix":"10.1142","volume":"29","author":[{"given":"Christopher","family":"Czyba","sequence":"first","affiliation":[{"name":"RWTH Aachen University, 52056 Aachen, Germany"}]},{"given":"Wolfgang","family":"Thomas","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, 52056 Aachen, Germany"}]},{"given":"Christopher","family":"Spinrath","sequence":"additional","affiliation":[{"name":"TU Dortmund University, 44227 Dortmund, Germany"}]}],"member":"219","published-online":{"date-parts":[[2018,4,11]]},"reference":[{"key":"S012905411840004XBIB002","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4_16"},{"key":"S012905411840004XBIB003","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-4(1:8)2008"},{"issue":"4","key":"S012905411840004XBIB005","first-page":"27","volume":"12","author":"Boja\u0144czyk M.","year":"2011","journal-title":"ACM Trans. Comput. Log. (TOCL)"},{"key":"S012905411840004XBIB009","series-title":"Springer Undergraduate Texts in Mathematics and Technology","volume-title":"Mathematical Logic","author":"Ebbinghaus H.-D.","year":"1996"},{"key":"S012905411840004XBIB010","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(80)90151-9"},{"key":"S012905411840004XBIB011","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90242-9"},{"key":"S012905411840004XBIB012","volume-title":"Computation: Finite and Infinite Machines","author":"Minsky M. L.","year":"1967"},{"key":"S012905411840004XBIB013","volume-title":"Picture Languages","author":"Rosenfeld A.","year":"1979"},{"key":"S012905411840004XBIB016","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6_7"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905411840004X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T12:27:30Z","timestamp":1565180850000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905411840004X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":9,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2018,4,11]]},"published-print":{"date-parts":[[2018,2]]}},"alternative-id":["10.1142\/S012905411840004X"],"URL":"https:\/\/doi.org\/10.1142\/s012905411840004x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2]]}}}