{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T06:07:52Z","timestamp":1776233272907,"version":"3.50.1"},"reference-count":40,"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.8785655","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":9,"title":["Separation and covering for group based concatenation hierarchies"],"prefix":"10.1109","author":[{"given":"Thomas","family":"Place","sequence":"first","affiliation":[]},{"given":"Marc","family":"Zeitoun","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90016-2"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(81)90057-8"},{"key":"ref33","author":"place","year":"2018","journal-title":"Separation for dot-depth two"},{"key":"ref32","article-title":"Generic results for concatenation hierarchies","author":"place","year":"2018","journal-title":"Theory of Computing Systems (TCS)"},{"key":"ref31","article-title":"The covering problem","volume":"14","author":"place","year":"2018","journal-title":"Logical Methods in Computer Science"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005070"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(85)90062-3"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(81)90036-0"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196701000462"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90108-7"},{"key":"ref10","article-title":"First order formulas with modular predicates","author":"chaubard","year":"2006","journal-title":"LICS'06"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3209108.3209201"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/PL00005951"},{"key":"ref12","volume":"b","author":"eilenberg","year":"1976","journal-title":"Automata Languages and Machines"},{"key":"ref13","first-page":"555","article-title":"Languages of dot-depth 3\/2","author":"glaber","year":"2000","journal-title":"STACS'00"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196791000298"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/1983170403211"},{"key":"ref16","article-title":"One quantifier alternation in first-order logic with modular predicates","volume":"49","author":"kufieitner","year":"2015","journal-title":"RAIRO TIA"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028813"},{"key":"ref18","author":"mcnaughton","year":"1971","journal-title":"Counter-Free Automata"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055073"},{"key":"ref28","first-page":"662","article-title":"Separation and the successor relation","author":"place","year":"2015","journal-title":"STACS '15"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196791000079"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43951-7_29"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90268-7"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0022-0000(71)80003-X","article-title":"Dot-depth of star-free events","volume":"5","author":"brzozowski","year":"1971","journal-title":"J Comp Sys Sci"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/2815493.2815495","article-title":"The tale of the quantifier alternation hierarchy of first-order logic over words","volume":"2","author":"place","year":"2015","journal-title":"SIGLOG news"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"2693","DOI":"10.1090\/S0002-9939-03-06860-6","article-title":"On the extension problem for partial permutations","volume":"131","author":"auinger","year":"2003","journal-title":"Proc Amer Math Soc"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90162-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90049-1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0039607"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2013.07.003"},{"key":"ref1","first-page":"531","article-title":"Some algorithmic problems for pseudovarieties","volume":"54","author":"almeida","year":"1999","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00230-4"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1142\/9789813148208_0008"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38771-5_5"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1081\/AGB-120006484"},{"key":"ref23","first-page":"259","article-title":"Monoids of upper triangular boolean matrices","volume":"39","author":"pin","year":"1985","journal-title":"Semigroups Structure and Universal Algebraic Problems"},{"key":"ref26","article-title":"Separating regular languages with two quantifier alternations","volume":"14","author":"place","year":"2018","journal-title":"Logical Methods in Computer Science"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.28"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Vancouver, BC, Canada","start":{"date-parts":[[2019,6,24]]},"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\/08785655.pdf?arnumber=8785655","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\/8785655\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785655","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}