{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T12:02:01Z","timestamp":1752667321759,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T00:00:00Z","timestamp":1405296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,14]]},"DOI":"10.1145\/2603088.2603098","type":"proceedings-article","created":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T13:21:45Z","timestamp":1406553705000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Separating regular languages with first-order logic"],"prefix":"10.1145","author":[{"given":"Thomas","family":"Place","sequence":"first","affiliation":[{"name":"LaBRI, Bordeaux University, France"}]},{"given":"Marc","family":"Zeitoun","sequence":"additional","affiliation":[{"name":"LaBRI, Bordeaux University, France"}]}],"member":"320","published-online":{"date-parts":[[2014,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"531","article-title":"Some algorithmic problems for pseudovarieties","volume":"54","author":"Almeida J.","year":"1999","unstructured":"J. Almeida . Some algorithmic problems for pseudovarieties . Publ. Math. Debrecen , 54 : 531 -- 552 , 1999 . Proc. of Automata and Formal Languages, VIII. J. Almeida. Some algorithmic problems for pseudovarieties. Publ. Math. Debrecen, 54:531--552, 1999. Proc. of Automata and Formal Languages, VIII.","journal-title":"Publ. Math. Debrecen"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90258-4"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90075-D"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39212-2_16"},{"key":"e_1_3_2_1_5_1","first-page":"261","volume-title":"Logic and Automata: History and Perspectives","author":"Diekert V.","year":"2008","unstructured":"V. Diekert and P. Gastin . First-order definable languages . In Logic and Automata: History and Perspectives , volume 2 , pages 261 -- 306 . Amsterdam Univ. Press , 2008 . V. Diekert and P. Gastin. First-order definable languages. In Logic and Automata: History and Perspectives, volume 2, pages 261--306. Amsterdam Univ. Press, 2008."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(88)90042-4"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196710005662"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"N. Immerman. Descriptive Complexity. Springer 1999.  N. Immerman. Descriptive Complexity . Springer 1999.","DOI":"10.1007\/978-1-4612-0539-5"},{"key":"e_1_3_2_1_9_1","volume-title":"CS Department","author":"Kamp H. W.","year":"1968","unstructured":"H. W. Kamp . Tense Logic and the Theory of Linear Order. Phd thesis , CS Department , University of California at Los Angeles , USA, 1968 . H. W. Kamp. Tense Logic and the Theory of Linear Order. Phd thesis, CS Department, University of California at Los Angeles, USA, 1968."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(77)90443-0"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1024196"},{"key":"e_1_3_2_1_12_1","volume-title":"Counter-Free Automata","author":"McNaughton R.","year":"1971","unstructured":"R. McNaughton and S. Papert . Counter-Free Automata . MIT Press , 1971 . R. McNaughton and S. Papert. Counter-Free Automata. MIT Press, 1971."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/645716.665310"},{"key":"e_1_3_2_1_14_1","volume-title":"Infinite Words","author":"Perrin D.","year":"2004","unstructured":"D. Perrin and J. E. Pin . Infinite Words . Elsevier , 2004 . D. Perrin and J. E. Pin. Infinite Words. Elsevier, 2004."},{"key":"e_1_3_2_1_15_1","unstructured":"J. E. Pin. Mathematical foundations of automata theory. http:\/\/www.liafa.jussieu.fr\/~jep\/PDF\/MPRI\/MPRI.pdf 2014.  J. E. Pin. Mathematical foundations of automata theory. http:\/\/www.liafa.jussieu.fr\/~jep\/PDF\/MPRI\/MPRI.pdf 2014."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40313-2_64"},{"key":"e_1_3_2_1_17_1","volume-title":"FSTTCS'13","author":"Place T.","year":"2013","unstructured":"T. Place , L. van Rooijen , and M. Zeitoun . Separating regular languages by locally testable and locally threshold testable languages . In FSTTCS'13 , LIPIcs, 2013 . T. Place, L. van Rooijen, and M. Zeitoun. Separating regular languages by locally testable and locally threshold testable languages. In FSTTCS'13, LIPIcs, 2013."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90108-7"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0289-9","volume-title":"Finite Automata, Formal Logic and Circuit Complexity","author":"Straubing H.","year":"1994","unstructured":"H. Straubing . Finite Automata, Formal Logic and Circuit Complexity . Birkhauser , 1994 . H. Straubing. Finite Automata, Formal Logic and Circuit Complexity. Birkhauser, 1994."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(79)90629-6"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/267871.267878"},{"key":"e_1_3_2_1_22_1","volume-title":"ICALP'91","author":"Wilke T.","year":"1991","unstructured":"T. Wilke . An Eilenberg theorem for infinity-languages . In ICALP'91 , 1991 . T. Wilke. An Eilenberg theorem for infinity-languages. In ICALP'91, 1991."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1764891.1764895"}],"event":{"name":"CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Vienna Austria","acronym":"CSL-LICS '14"},"container-title":["Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603098","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2603088.2603098","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:34Z","timestamp":1750278154000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603098"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,14]]},"references-count":23,"alternative-id":["10.1145\/2603088.2603098","10.1145\/2603088"],"URL":"https:\/\/doi.org\/10.1145\/2603088.2603098","relation":{},"subject":[],"published":{"date-parts":[[2014,7,14]]},"assertion":[{"value":"2014-07-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}