{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:29:40Z","timestamp":1767929380476,"version":"3.49.0"},"reference-count":48,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/lics.2017.8005111","type":"proceedings-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T20:43:24Z","timestamp":1502397804000},"page":"1-12","source":"Crossref","is-referenced-by-count":11,"title":["Register automata with linear arithmetic"],"prefix":"10.1109","author":[{"given":"Yu-Fang","family":"Chen","sequence":"first","affiliation":[]},{"given":"Ondrej","family":"Lengal","sequence":"additional","affiliation":[]},{"given":"Tony","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Zhilin","family":"Wu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129514000322"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11439-2_9"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.2307\/1970290"},{"key":"ref31","author":"chvatal","year":"1983","journal-title":"Linear Programming"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1946-08555-9"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/11562948_36"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90008-6"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/0213029"},{"key":"ref34","article-title":"The reachability problem requires exponential space","author":"lipton","year":"1976","journal-title":"Tech Rep 62"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1085"},{"key":"ref40","article-title":"N-memory automata over the alphabet N","author":"brutsch","year":"2017","journal-title":"Proc LATA"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90242-9"},{"key":"ref12","author":"abiteboul","year":"1995","journal-title":"Foundations of Databases"},{"key":"ref13","author":"minsky","year":"1967","journal-title":"Computation Finite and Infinite Machines"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926454"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1013560.1013562"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF00268497"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_52"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1561\/0400000039"},{"key":"ref28","article-title":"On the complexity of constant propagation","author":"muller-olm","year":"2000","journal-title":"Proc of ESOP"},{"key":"ref4","article-title":"Distributed streaming with finite memory","author":"neven","year":"2015","journal-title":"Proc of ICDT"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005111"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41540-6_6"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926420"},{"key":"ref29","author":"hungerford","year":"2003","journal-title":"Algebra"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-014-0216-x"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13089-2_47"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2850413"},{"key":"ref2","article-title":"Automata for data words and data trees","author":"bojariczyk","year":"2010","journal-title":"Proc RTAS"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1507244.1507246"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/11874683_3"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-015-0233-4"},{"key":"ref20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","volume":"315","author":"burgisser","year":"1997","journal-title":"Algebraic Complexity Theory"},{"key":"ref45","article-title":"Applications of symbolic finite automata","author":"veanes","year":"2013","journal-title":"Proc of CIAA"},{"key":"ref48","article-title":"On the complexity of equational Horn clauses","author":"verma","year":"2005","journal-title":"Proc of CAD E"},{"key":"ref22","article-title":"A note on Kart's algorithm","author":"muller-olm","year":"2004","journal-title":"Proc of ICALP"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21500-6_16"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/070697926"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46750-4_21"},{"key":"ref24","article-title":"MapReduce: Simplified data processing on large clusters","author":"dean","year":"2004","journal-title":"Proc of OSDI"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2013.65"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-1989-15750-9"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103674"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2591062.2591177"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(61)80020-X"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46681-0_9"}],"event":{"name":"2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Reykjavik, Iceland","start":{"date-parts":[[2017,6,20]]},"end":{"date-parts":[[2017,6,23]]}},"container-title":["2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999337\/8005055\/08005111.pdf?arnumber=8005111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T07:39:51Z","timestamp":1570001991000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8005111\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/lics.2017.8005111","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}