{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:01:07Z","timestamp":1725858067046},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319401881"},{"type":"electronic","value":"9783319401898"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40189-8_30","type":"book-chapter","created":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T11:34:07Z","timestamp":1465817647000},"page":"292-301","source":"Crossref","is-referenced-by-count":1,"title":["The Boolean Algebra of Piecewise Testable Languages"],"prefix":"10.1007","author":[{"given":"Anton","family":"Konovalov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Selivanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,14]]},"reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/978-3-540-70583-3_21","volume-title":"Automata, Languages and Programming","author":"M Gehrke","year":"2008","unstructured":"Gehrke, M., Grigorieff, S., Pin, J.\u00c9.: Duality and equational theory of regular languages. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 246\u2013257. Springer, Heidelberg (2008)"},{"key":"30_CR2","volume-title":"Countable Boolean Algebras and Decidability","author":"SS Goncharov","year":"1996","unstructured":"Goncharov, S.S.: Countable Boolean Algebras and Decidability. Plenum, New York (1996)"},{"issue":"4","key":"30_CR3","first-page":"456","volume":"20","author":"W Hanf","year":"1975","unstructured":"Hanf, W.: The boolean algebra of logic. Bull. Amer. Math. Soc. 20(4), 456\u2013502 (1975)","journal-title":"Bull. Amer. Math. Soc."},{"key":"30_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.2307\/1970929","volume":"108","author":"J Ketonen","year":"1978","unstructured":"Ketonen, J.: The structure of countable Boolean algebras. Ann. Math. 108, 41\u201389 (1978)","journal-title":"Ann. Math."},{"key":"30_CR5","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1515\/9781614518044.191","volume-title":"Logic, Computation, Hierarchies","author":"A Konovalov","year":"2014","unstructured":"Konovalov, A.: Boolean algebras of regular quasi-aperiodic languages. In: Brattka, V., Diener, H., Spreen, D. (eds.) Logic, Computation, Hierarchies, pp. 191\u2013204. Ontos Publishing de Gruiter, Boston (2014)"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1007\/978-3-642-37064-9_44","volume-title":"Language and Automata Theory and Applications","author":"V Selivanov","year":"2013","unstructured":"Selivanov, V., Konovalov, A.: Boolean algebras of regular $$\\omega $$ \u03c9 -languages. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol. 7810, pp. 504\u2013515. Springer, Heidelberg (2013)"},{"issue":"2","key":"30_CR7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1142\/S0219061302000163","volume":"2","author":"S Lempp","year":"2002","unstructured":"Lempp, S., Peretyat\u2019kin, M., Solomon, R.: The Lindenbaum algebra of the theory of the class of all finite models. J. Math. Log. 2(2), 145\u2013225 (2002)","journal-title":"J. Math. Log."},{"key":"30_CR8","doi-asserted-by":"crossref","first-page":"6531","DOI":"10.1016\/j.tcs.2011.08.022","volume":"412","author":"C Marini","year":"2011","unstructured":"Marini, C., Sorbi, A., Simi, G., Sorrentino, M.: A note on algebras of languages. Theor. Comput. Sci. 412, 6531\u20136536 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR9","unstructured":"Pin, J.-E.: Private communication"},{"issue":"2","key":"30_CR10","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02679444","volume":"30","author":"N Pippenger","year":"1997","unstructured":"Pippenger, N.: Regular languages and stone duality. Theor. Comput. Syst. 30(2), 121\u2013134 (1997)","journal-title":"Theor. Comput. Syst."},{"key":"30_CR11","unstructured":"Schmitz, H.: Some forbidden patterns in automata for dot-depth one languages. Ph.D. thesis, Technical report, 220, University of W\u00fcrzburg, Department of Computer Science (1999)"},{"key":"30_CR12","unstructured":"Selivanov, V.L.: Universal Boolean algebras with applications. In: Abstracts of International Conference in Algebra, Novosibirsk, p. 127 (1991) (in Russian)"},{"key":"30_CR13","unstructured":"Selivanov, V.L.: Hierarchies, numerations, index sets. In: Handwritten Notes, p. 290 (1992)"},{"key":"30_CR14","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/978-1-4615-0755-0_14","volume-title":"Computability and Models, Perspectives East and West","author":"VL Selivanov","year":"2003","unstructured":"Selivanov, V.L.: Positive structures. In: Cooper, S.B., Goncharov, S.S. (eds.) Computability and Models, Perspectives East and West, pp. 321\u2013350. Kluwer Academic\/Plenum Publishers, New York (2003)"},{"key":"30_CR15","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1051\/ita:2007063","volume":"41","author":"VL Selivanov","year":"2009","unstructured":"Selivanov, V.L.: Hierarchies and reducibilities on regular languages related to modulo counting. RAIRO Theor. Inform. Appl. 41, 95\u2013132 (2009)","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1007\/978-3-642-22321-1_33","volume-title":"Developments in Language Theory","author":"V Selivanov","year":"2011","unstructured":"Selivanov, V., Konovalov, A.: Boolean algebras of regular languages. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 386\u2013396. Springer, Heidelberg (2011)"},{"key":"30_CR17","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(85)90003-9","volume":"35","author":"J Stern","year":"1985","unstructured":"Stern, J.: Characterizations of some classes of regular events. Theoret. Comput. Sci. 35, 17\u201342 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0289-9","volume-title":"Finite Automata, Formal Logic and Circuit Complexity","author":"H Straubing","year":"1994","unstructured":"Straubing, H.: Finite Automata, Formal Logic and Circuit Complexity. Birkh\u00e4user, Boston (1994)"},{"key":"30_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1007\/3-540-55808-X_48","volume-title":"Mathematical Foundations of Computer Science 1992","author":"A Szilard","year":"1992","unstructured":"Szilard, A., Yu, S., Zhang, K., Shallit, J.: Characterizing regular languages with polynomial densities. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol. 629, pp. 494\u2013503. Springer, Heidelberg (1992)"},{"key":"30_CR20","first-page":"133","volume-title":"Handbook of Formal Language theory","author":"W Thomas","year":"1996","unstructured":"Thomas, W.: Languages, automata and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Language theory, vol. B, pp. 133\u2013191. Springer, Heidelberg (1996)"},{"key":"30_CR21","volume-title":"A Chapter of Handbook of Formal Languages","author":"S Yu","year":"1997","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) A Chapter of Handbook of Formal Languages. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Pursuit of the Universal"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40189-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T13:12:11Z","timestamp":1656681131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40189-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319401881","9783319401898"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40189-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}