{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:31:35Z","timestamp":1730280695375,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"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":[[2019,6]]},"DOI":"10.1109\/lics.2019.8785666","type":"proceedings-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T01:15:55Z","timestamp":1565054155000},"page":"1-13","source":"Crossref","is-referenced-by-count":0,"title":["Descriptive complexity for minimal time of cellular automata"],"prefix":"10.1109","author":[{"given":"Etienne","family":"Grandjean","sequence":"first","affiliation":[]},{"given":"Theo","family":"Grente","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Foundations of Databases","year":"1995","author":"abiteboul","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1969.222663"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(72)80004-7"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(80)90164-3"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00329-6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-62809-7_14"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264617"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/0216072"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_11"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00111-5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90149-A"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/321281.321290"},{"journal-title":"Finite Model Theory and Its Applications","year":"2007","author":"gradel","key":"ref5"},{"key":"ref8","first-page":"99:1","article-title":"Definability by Horn Formulas and Linear Time on Cellular Automata","volume":"80","author":"bacquey","year":"2017","journal-title":"ICALP 2017"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0129-1_9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2016.01.005"},{"key":"ref1","first-page":"43","article-title":"Generalized first-order spectra and polynomial-time recognizable sets’","author":"fagin","year":"1974","journal-title":"Complexity of Computation SIAM-AMS Proceedings"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92910-9_4"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1080\/00207168408803410","article-title":"Systolic trellis automata. I","volume":"15","author":"culfk","year":"1984","journal-title":"International Journal Computer Mathematics"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-58631-1_14"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2013.06.001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2004004"},{"journal-title":"Communication Complexity","year":"1997","author":"kushilevitz","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00489-9"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2019,6,24]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2019,6,27]]}},"container-title":["2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8765678\/8785654\/08785666.pdf?arnumber=8785666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:20:37Z","timestamp":1658262037000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785666\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785666","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}