{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:13:27Z","timestamp":1743066807507,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857792"},{"type":"electronic","value":"9783540857808"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85780-8_38","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T05:23:54Z","timestamp":1220937834000},"page":"479-490","source":"Crossref","is-referenced-by-count":4,"title":["Hierarchies of Piecewise Testable Languages"],"prefix":"10.1007","author":[{"given":"Ond\u0159ej","family":"Kl\u00edma","sequence":"first","affiliation":[]},{"given":"Libor","family":"Pol\u00e1k","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-4049(91)90019-X","volume":"69","author":"J. Almeida","year":"1990","unstructured":"Almeida, J.: Implicit operations on finite $\\mathcal J$-trivial semigroups and a conjecture of I. Simon. J. Pure Appl. Algebra\u00a069, 205\u2013218 (1990)","journal-title":"J. Pure Appl. Algebra"},{"key":"38_CR2","volume-title":"Finite Semigroups and Universal Algebra","author":"J. Almeida","year":"1994","unstructured":"Almeida, J.: Finite Semigroups and Universal Algebra. World Scientific, Singapore (1994)"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/0898-1221(89)90179-X","volume":"18","author":"F. Blanchet-Sadri","year":"1989","unstructured":"Blanchet-Sadri, F.: Games, equations and the dot-depth hierarchy. Comput. Math. Appl.\u00a018, 809\u2013822 (1989)","journal-title":"Comput. Math. Appl."},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0304-3975(92)00064-X","volume":"123","author":"F. Blanchet-Sadri","year":"1994","unstructured":"Blanchet-Sadri, F.: Equations and monoids varieties of dot-depth one and two. Theoret. Comput. Sci.\u00a0123, 239\u2013258 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"38_CR5","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1976","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol.\u00a0B. Academic Press, New York (1976)"},{"key":"38_CR6","first-page":"1","volume":"16","author":"Z. \u00c9sik","year":"2003","unstructured":"\u00c9sik, Z., Ito, M.: Temporal logic with cyclic counting and the degree of aperiodicity of finite automata. Acta Cybernetica\u00a016, 1\u201328 (2003)","journal-title":"Acta Cybernetica"},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0304-3975(96)00230-7","volume":"178","author":"P. Higgins","year":"1997","unstructured":"Higgins, P.: A proof of Simon\u2019s Theorem on piecewise testable languages. Theoret. Comput. Sci.\u00a0178, 257\u2013264 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"38_CR8","unstructured":"Kl\u00edma, O., Pol\u00e1k, L.: Classes of meet automata. Theoret. Comput. Sci. (to appear)"},{"key":"38_CR9","unstructured":"Kl\u00edma, O., Pol\u00e1k, L.: Hierarchies of piecewise testable languages, a version containing also Appendix, \n                      http:\/\/www.math.muni.cz\/~polak"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Pin, J.-E.: Varieties of Formal Languages. North Oxford Academic, Plenum (1986)","DOI":"10.1007\/978-1-4613-2215-3"},{"key":"38_CR11","first-page":"1","volume-title":"NATO Advanced Study Institute Semigroups, Formal Languages and Groups","author":"J.-E. Pin","year":"1995","unstructured":"Pin, J.-E.: Finite semigroups and recognizable languages: an introduction. In: Fountain, J. (ed.) NATO Advanced Study Institute Semigroups, Formal Languages and Groups, pp. 1\u201332. Kluwer Academic Publisher, Dordrecht (1995)"},{"key":"38_CR12","first-page":"74","volume":"39","author":"J.-E. Pin","year":"1995","unstructured":"Pin, J.-E.: A variety theorem without complementation. Russian Mathem (Iz. VUZ)\u00a039, 74\u201383 (1995)","journal-title":"Russian Mathem. (Iz. VUZ)"},{"key":"38_CR13","volume-title":"Handbook of Formal Languages, ch. 10","author":"J.-E. Pin","year":"1997","unstructured":"Pin, J.-E.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, ch. 10. Springer, Heidelberg (1997)"},{"key":"38_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02679450","volume":"30","author":"J.-E. Pin","year":"1997","unstructured":"Pin, J.-E., Weil, P.: Polynomial closure and unambiguous product. Theory Comput. Syst.\u00a030, 1\u201339 (1997)","journal-title":"Theory Comput. Syst."},{"key":"38_CR15","first-page":"395","volume":"40","author":"L. Pol\u00e1k","year":"2004","unstructured":"Pol\u00e1k, L.: A classification of rational languages by semilattice-ordered monoids. Arch. Math. (Brno)\u00a040, 395\u2013406 (2004)","journal-title":"Arch. Math. (Brno)"},{"key":"38_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1007\/978-3-540-28629-5_49","volume-title":"Mathematical Foundations of Computer Science 2004","author":"L. Pol\u00e1k","year":"2004","unstructured":"Pol\u00e1k, L.: On pseudovarieties of semiring morphisms. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 635\u2013647. Springer, Heidelberg (2004)"},{"key":"38_CR17","unstructured":"Simon, I.: Hierarchies of events of dot-depth one, Ph.D. thesis, University of Waterloo (1972)"},{"key":"38_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/3-540-07407-4_23","volume-title":"Proc. ICALP 1975","author":"I. Simon","year":"1975","unstructured":"Simon, I.: Piecewise testable events. In: Proc. ICALP 1975. LNCS, vol.\u00a033, pp. 214\u2013222. Springer, Heidelberg (1975)"},{"key":"38_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0304-3975(85)90003-9","volume":"35","author":"J. Stern","year":"1985","unstructured":"Stern, J.: Characterization of some classes of regular events. Theoret. Comput. Sci.\u00a035, 17\u201342 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"38_CR20","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02572507","volume":"19","author":"H. Straubing","year":"1980","unstructured":"Straubing, H.: On finite $\\mathcal J$-trivial monoids. Semigroup Forum\u00a019, 107\u2013110 (1980)","journal-title":"Semigroup Forum"},{"key":"38_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/3-540-45995-2_46","volume-title":"LATIN 2002: Theoretical Informatics","author":"H. Straubing","year":"2002","unstructured":"Straubing, H.: On logical description of regular languages. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 528\u2013538. Springer, Heidelberg (2002)"},{"key":"38_CR22","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0021-8693(88)90067-1","volume":"119","author":"H. Straubing","year":"1988","unstructured":"Straubing, H., Th\u00e9rien, D.: Partially ordered finite monoids and a theorem of I.\u00a0Simon. J. Algebra\u00a0119, 393\u2013399 (1988)","journal-title":"J. Algebra"},{"key":"38_CR23","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1142\/S0218196704002018","volume":"14","author":"M.V. Volkov","year":"2004","unstructured":"Volkov, M.V.: Reflexive relations, extensive transformations and piecewise testable languages of a given height. Internat. J. Algebra Comput.\u00a014, 817\u2013827 (2004)","journal-title":"Internat. J. Algebra Comput."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85780-8_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T14:24:23Z","timestamp":1676643863000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85780-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540857792","9783540857808"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85780-8_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}