{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:22:55Z","timestamp":1781893375203,"version":"3.54.5"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319221762","type":"print"},{"value":"9783319221779","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22177-9_14","type":"book-chapter","created":{"date-parts":[[2015,8,3]],"date-time":"2015-08-03T10:05:43Z","timestamp":1438596343000},"page":"173-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Note on Decidable Separability by Piecewise Testable Languages"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Czerwi\u0144ski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wim","family":"Martens","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lorijn","family":"van Rooijen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"Zeitoun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,8,4]]},"reference":[{"issue":"4","key":"14_CR1","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1145\/321479.321488","volume":"15","author":"AV Aho","year":"1968","unstructured":"Aho, A.V.: Indexed grammars \u2013 an extension of context-free grammars. J. ACM 15(4), 647\u2013671 (1968)","journal-title":"J. ACM"},{"key":"14_CR2","volume-title":"Finite Semigroups and Universal Algebra, Volume 3 of Series in Algebra","author":"J Almeida","year":"1994","unstructured":"Almeida, J.: Finite Semigroups and Universal Algebra, Volume 3 of Series in Algebra. World Scientific Publishing Company, Singapore (1994)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Antonopoulos, T., Hovland, D., Martens, W., Neven, F.: Deciding twig-definability of node selecting tree automata. In: ICDT, pp. 61\u201373 (2012)","DOI":"10.1145\/2274576.2274584"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Arfi, M.: Polynomial operations on rational languages. In: STACS, pp. 198\u2013206 (1987)","DOI":"10.1007\/BFb0039607"},{"issue":"1","key":"14_CR5","first-page":"4:1","volume":"11","author":"M Benedikt","year":"2009","unstructured":"Benedikt, M., Segoufin, L.: Regular tree languages definable in FO and in FO$$_{\\rm mod}$$. ACM Trans. Comput. Logi 11(1), 4:1\u20134:32 (2009)","journal-title":"ACM Trans. Comput. Logi"},{"key":"14_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and context-free languages","author":"J Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and context-free languages. Teubner, Stuttgart (1979)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-04081-8_10","volume-title":"CONCUR 2009 - Concurrency Theory","author":"M Boja\u0144czyk","year":"2009","unstructured":"Boja\u0144czyk, M., Idziaszek, T.: Algebra for infinite forests with an application to the temporal logic EF. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 131\u2013145. Springer, Heidelberg (2009)"},{"issue":"3","key":"14_CR8","first-page":"1","volume":"8","author":"M Bojanczyk","year":"2012","unstructured":"Bojanczyk, M., Segoufin, L., Straubing, H.: Piecewise testable tree languages. LMCS 8(3), 1\u201320 (2012)","journal-title":"LMCS"},{"issue":"2","key":"14_CR9","first-page":"1","volume":"8","author":"R Bonnet","year":"2012","unstructured":"Bonnet, R., Finkel, A., Leroux, J., Zeitoun, M.: Model checking vector addition systems with one zero-test. LMCS 8(2), 1\u201325 (2012)","journal-title":"LMCS"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-642-39212-2_16","volume-title":"Automata, Languages, and Programming","author":"W Czerwi\u0144ski","year":"2013","unstructured":"Czerwi\u0144ski, W., Martens, W., Masopust, T.: Efficient separability of regular languages by subsequences and suffixes. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 150\u2013161. Springer, Heidelberg (2013)"},{"issue":"12","key":"14_CR11","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.ipl.2011.03.019","volume":"111","author":"J Esparza","year":"2011","unstructured":"Esparza, J., Ganty, P., Kiefer, S., Luttenberger, M.: Parikh\u2019s theorem: a simple and direct automaton construction. Inf. Process. Lett. 111(12), 614\u2013619 (2011)","journal-title":"Inf. Process. Lett."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Ginsburg, S., Greibach, S.A.: Abstract families of languages. In: SWAT \/ FOCS, pp. 128\u2013139 (1967)","DOI":"10.1109\/FOCS.1967.3"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and languages. Pacific J. Math. 16, 285\u2013296 (1966)","journal-title":"Pacific J. Math."},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01691341","volume":"2","author":"S Greibach","year":"1968","unstructured":"Greibach, S.: A note on undecidable properties of formal languages. Math. Sys. Theor. 2(1), 1\u20136 (1968)","journal-title":"Math. Sys. Theor."},{"key":"14_CR15","unstructured":"Hofman, P., Martens, W.: Separability by short subsequences and subwords. In: ICDT, pp. 230\u2013246 (2015)"},{"issue":"2","key":"14_CR16","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1145\/322307.322317","volume":"29","author":"HB Hunt III","year":"1982","unstructured":"Hunt III, H.B.: On the decidability of grammar problems. J. ACM 29(2), 429\u2013447 (1982)","journal-title":"J. ACM"},{"issue":"1","key":"14_CR17","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1051\/ita\/1979130100191","volume":"13","author":"M Jantzen","year":"1979","unstructured":"Jantzen, M.: On the hierarchy of Petri net languages. RAIRO Informatique Th\u00e9orique 13(1), 19\u201330 (1979)","journal-title":"RAIRO Informatique Th\u00e9orique"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R.: Decidability of reachability in vector addition systems (preliminary version). In: STOC, pp. 267\u2013281 (1982)","DOI":"10.1145\/800070.802201"},{"issue":"3","key":"14_CR19","first-page":"1","volume":"6","author":"J Leroux","year":"2010","unstructured":"Leroux, J.: The general vector addition system reachability problem by Presburger inductive invariants. LMCS 6(3), 1\u201325 (2010)","journal-title":"LMCS"},{"issue":"1","key":"14_CR20","first-page":"38","volume":"12","author":"AN Maslov","year":"1976","unstructured":"Maslov, A.N.: Multilevel stack automata. Probl. Inf. Transm. 12(1), 38\u201342 (1976)","journal-title":"Probl. Inf. Transm."},{"issue":"3","key":"14_CR21","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"EW Mayr","year":"1984","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM J. Comput. 13(3), 441\u2013460 (1984)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"14_CR22","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BF01761708","volume":"8","author":"R McNaughton","year":"1974","unstructured":"McNaughton, R.: Algebraic decision procedures for local testability. Math. Syst. Theor. 8(1), 60\u201376 (1974)","journal-title":"Math. Syst. Theor."},{"issue":"4","key":"14_CR23","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R Parikh","year":"1966","unstructured":"Parikh, R.: On context-free languages. J. ACM 13(4), 570\u2013581 (1966)","journal-title":"J. ACM"},{"issue":"4","key":"14_CR24","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF02679467","volume":"30","author":"J-E Pin","year":"1997","unstructured":"Pin, J.-E., Weil, P.: Polynomial closure and unambiguous product. Theory Comput. Syst. 30(4), 383\u2013422 (1997)","journal-title":"Theory Comput. Syst."},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Place, T., van Rooijen, L., Zeitoun, M.: Separating regular languages by locally testable and locally threshold testable languages. In: FSTTCS, pp. 363\u2013375 (2013)","DOI":"10.2168\/LMCS-10(3:24)2014"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/978-3-642-40313-2_64","volume-title":"Mathematical Foundations of Computer Science 2013","author":"T Place","year":"2013","unstructured":"Place, T., van Rooijen, L., Zeitoun, M.: Separating regular languages by piecewise testable and unambiguous languages. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 729\u2013740. Springer, Heidelberg (2013)"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/978-3-662-43951-7_29","volume-title":"Automata, Languages, and Programming","author":"T Place","year":"2014","unstructured":"Place, T., Zeitoun, M.: Going higher in the first-order quantifier alternation hierarchy on words. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol. 8573, pp. 342\u2013353. Springer, Heidelberg (2014)"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Place, T., Zeitoun, M.: Separating regular languages with first-order logic. In: CSL-LICS, pp. 75:1\u201375:10. ACM (2014)","DOI":"10.1145\/2603088.2603098"},{"issue":"2","key":"14_CR29","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"MP Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.P.: On finite monoids having only trivial subgroups. Inf. Control 8(2), 190\u2013194 (1965)","journal-title":"Inf. Control"},{"key":"14_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/3-540-07407-4_23","volume-title":"Automata Theory and Formal Languages","author":"I Simon","year":"1975","unstructured":"Simon, I.: Piecewise testable events. In: Simon, I. (ed.) Automata Theory and Formal Languages. LNCS, pp. 214\u2013222. springer, Heidelberg (1975)"},{"issue":"1","key":"14_CR31","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0304-3975(90)90047-L","volume":"72","author":"I Simon","year":"1990","unstructured":"Simon, I.: Factorization forests of finite height. Theor. Comput. Sci. 72(1), 65\u201394 (1990)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR32","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0304-3975(88)90034-5","volume":"58","author":"H Straubing","year":"1988","unstructured":"Straubing, H.: Semigroups and languages of dot-depth two. Theor. Comput. Sci. 58, 361\u2013378 (1988)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"14_CR33","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1137\/0205019","volume":"5","author":"T Szymanski","year":"1976","unstructured":"Szymanski, T., Williams, J.: Noncanonical extensions of bottom-up parsing techniques. SIAM J. Comput. 5(2), 231\u2013250 (1976)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"14_CR34","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0022-0000(72)80020-5","volume":"6","author":"Y Zalcstein","year":"1972","unstructured":"Zalcstein, Y.: Locally testable languages. J. Comput. Syst. Sci. 6(2), 151\u2013167 (1972)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR35","unstructured":"Zetzsche, G.: Personal communication"},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"Zetzsche, G.: An approach to computing downward closures. In: ICALP (2015). To appear, Accessed on http:\/\/arxiv.org\/abs\/1503.01068","DOI":"10.1007\/978-3-662-47666-6_35"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22177-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T04:21:37Z","timestamp":1675138897000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22177-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319221762","9783319221779"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22177-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"4 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}