{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:10:09Z","timestamp":1771024209864,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642387708","type":"print"},{"value":"9783642387715","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38771-5_26","type":"book-chapter","created":{"date-parts":[[2013,6,10]],"date-time":"2013-06-10T02:16:25Z","timestamp":1370830585000},"page":"289-300","source":"Crossref","is-referenced-by-count":11,"title":["Alternative Automata Characterization 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":"26_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 \n                    \n                      \n                    \n                    $\\mathcal J$\n                  -trivial semigroups and a conjecture of I. Simon. J. Pure Appl. Algebra\u00a069, 205\u2013218 (1990)","journal-title":"J. Pure Appl. Algebra"},{"key":"26_CR2","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":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-31623-4_15","volume-title":"Descriptional Complexity of Formal Systems","author":"G. Jir\u00e1skov\u00e1","year":"2012","unstructured":"Jir\u00e1skov\u00e1, G., Kl\u00edma, O.: Descriptional complexity of biautomata. In: Kutrib, M., Moreira, N., Reis, R. (eds.) DCFS 2012. LNCS, vol.\u00a07386, pp. 196\u2013208. Springer, Heidelberg (2012)"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"2124","DOI":"10.1016\/j.disc.2011.06.013","volume":"311","author":"O. Kl\u00edma","year":"2011","unstructured":"Kl\u00edma, O.: Piecewise testable languages via combinatorics on words. Discrete Mathematics\u00a0311, 2124\u20132127 (2011)","journal-title":"Discrete Mathematics"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-31653-1_31","volume-title":"Developments in Language Theory","author":"O. Kl\u00edma","year":"2012","unstructured":"Kl\u00edma, O., Pol\u00e1k, L.: Biautomata for k-piecewise testable languages. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol.\u00a07410, pp. 344\u2013355. Springer, Heidelberg (2012)"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Pin, J.-E.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, ch.\u00a010. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_10"},{"key":"26_CR7","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":"26_CR8","unstructured":"Simon, I.: Hierarchies of events of dot-depth one. Ph.D. thesis. U. Waterloo (1972), \n                    \n                      http:\/\/maveric.uwaterloo.ca\/~brzozo\/phd.html"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/3-540-07407-4_23","volume-title":"ICALP 1975","author":"I. Simon","year":"1975","unstructured":"Simon, I.: Piecewise testable events. In: Brakhage, H. (ed.) ICALP 1975. LNCS, vol.\u00a033, pp. 214\u2013222. Springer, Heidelberg (1975)"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0019-9958(85)80058-9","volume":"66","author":"J. Stern","year":"1985","unstructured":"Stern, J.: Complexity of some problems from the theory of automata. Information and Control\u00a066, 163\u2013176 (1985)","journal-title":"Information and Control"},{"key":"26_CR11","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":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/3-540-44669-9_33","volume-title":"Fundamentals of Computation Theory","author":"A.N. Trahtman","year":"2001","unstructured":"Trahtman, A.N.: Piecewise and local threshold testability of DFA. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol.\u00a02138, pp. 347\u2013358. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38771-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:25:44Z","timestamp":1557793544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38771-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387708","9783642387715"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38771-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}