{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:22:56Z","timestamp":1725582176884},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208768"},{"type":"electronic","value":"9783642208775"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20877-5_26","type":"book-chapter","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T02:35:17Z","timestamp":1303871717000},"page":"252-263","source":"Crossref","is-referenced-by-count":8,"title":["An Algebraic Characterization of Strictly Piecewise Languages"],"prefix":"10.1007","author":[{"given":"Jie","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey","family":"Heinz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herbert G.","family":"Tanner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511607202","volume-title":"Automata Theory with Modern Applications","author":"J.A. Anderson","year":"2006","unstructured":"Anderson, J.A.: Automata Theory with Modern Applications. Cambridge University Press, Cambridge (2006)"},{"key":"26_CR2","volume-title":"The Algebraic Theory of Semigroups","author":"A. Clifford","year":"1967","unstructured":"Clifford, A.: The Algebraic Theory of Semigroups. American Mathematical Society, Providence (1967)"},{"key":"26_CR3","first-page":"125","volume":"7","author":"P. Garc\u00eda","year":"2004","unstructured":"Garc\u00eda, P., Ruiz, J.: Learning k-testable and k-piecewise testable languages from positive data. Grammars\u00a07, 125\u2013140 (2004)","journal-title":"Grammars"},{"issue":"1","key":"26_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.2307\/1969317","volume":"54","author":"J.A. Green","year":"1951","unstructured":"Green, J.A.: On the structure of semigroups. The Annals of Mathematics\u00a054(1), 163\u2013172 (1951)","journal-title":"The Annals of Mathematics"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/S0021-9800(69)80111-0","volume":"6","author":"L.H. Haines","year":"1969","unstructured":"Haines, L.H.: On free moniods partially ordered by embedding. Journal of Combinatorial Theory\u00a06, 94\u201398 (1969)","journal-title":"Journal of Combinatorial Theory"},{"issue":"4","key":"26_CR6","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1162\/LING_a_00015","volume":"41","author":"J. Heinz","year":"2010","unstructured":"Heinz, J.: Learning long-distance phonotactics. Linguistic Inquiry\u00a041(4), 623\u2013661 (2010)","journal-title":"Linguistic Inquiry"},{"issue":"2","key":"26_CR7","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"3","author":"G. Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society\u00a03(2), 326\u2013336 (1952)","journal-title":"Proceedings of the London Mathematical Society"},{"key":"26_CR8","first-page":"139","volume":"83","author":"M. Holzer","year":"2004","unstructured":"Holzer, M., K\u00f6nig, B.: Regular languages, sizes of syntactic monoids, graph colouring, state complexity results, and how these topics are related to each other. EATCS Bulletin\u00a083, 139\u2013155 (2004)","journal-title":"EATCS Bulletin"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. Tech. rep., Stanford, CA, USA (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"26_CR10","volume-title":"Counter-Free Automata","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Pin, J.\u00c9.: Syntactic Semigroups. In: Rozenberg, G., Salomaa, A. (eds.), vol.\u00a01, Springer, Heidelberg (1997)","DOI":"10.1007\/978-3-642-59136-5_10"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-14322-9_19","volume-title":"The Mathematics of Language","author":"J. Rogers","year":"2010","unstructured":"Rogers, J., Heinz, J., Bailey, G., Edlefsen, M., Visscher, M., Wellcome, D., Wibel, S.: On languages piecewise testable in the strict sense. In: Ebert, C., J\u00e4ger, G., Michaelis, J. (eds.) MOL 10. LNCS, vol.\u00a06149, pp. 255\u2013265. Springer, Heidelberg (2010)"},{"key":"26_CR13","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: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol.\u00a033, pp. 214\u2013222. Springer, Heidelberg (1975)"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Thierrin, G.: Convex languages. In: ICALP 1972. pp. 481\u2013492 (1972)","DOI":"10.25291\/VR\/1972-VR-481"},{"issue":"1","key":"26_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0022-0000(83)90024-7","volume":"26","author":"T. Watanabe","year":"1983","unstructured":"Watanabe, T., Nakamura, A.: On the transformation semigroups of finite automata. Journal of Computer and System Sciences\u00a026(1), 107\u2013138 (1983)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20877-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:17:47Z","timestamp":1558574267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20877-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208768","9783642208775"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20877-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}