{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:59:49Z","timestamp":1725533989007},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027369"},{"type":"electronic","value":"9783642027376"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02737-6_10","type":"book-chapter","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T12:40:30Z","timestamp":1246365630000},"page":"125-144","source":"Crossref","is-referenced-by-count":4,"title":["Closures in Formal Languages and Kuratowski\u2019s Theorem"],"prefix":"10.1007","author":[{"given":"Janusz","family":"Brzozowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elyot","family":"Grant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. Aho","year":"1974","unstructured":"Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Brzozowski, J., Grant, E., Shallit, J.: Closures in formal languages and Kuratowski\u2019s theorem (preprint) (January 2009), http:\/\/arxiv.org\/abs\/0901.3761","DOI":"10.1007\/978-3-642-02737-6_10"},{"key":"10_CR3","unstructured":"Brzozowski, J., Grant, E., Shallit, J.: Closures in formal languages: concatenation, separation, and algorithms (January 2009), http:\/\/arxiv.org\/abs\/0901.3763"},{"key":"10_CR4","unstructured":"Burris, S.N., Sankappanavar, H.P.: A Course in Universal Algebra, 2nd edn., http:\/\/www.math.uwaterloo.ca\/snburris\/htdocs\/ualg.html"},{"key":"10_CR5","unstructured":"Chagrov, A.V.: Kuratowski numbers. In: Application of Functional Analysis in Approximation Theory, Kalinin. Gos. Univ., Kalinin, pp. 186\u2013190 (1982) (in Russian)"},{"key":"10_CR6","first-page":"407","volume":"10","author":"K. Ellul","year":"2005","unstructured":"Ellul, K., Krawetz, B., Shallit, J., Wang, M.-w.: Regular expressions: new results and open problems. J. Autom. Lang. Combin.\u00a010, 407\u2013437 (2005)","journal-title":"J. Autom. Lang. Combin."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"180","DOI":"10.2307\/2691300","volume":"64","author":"J.H. Fife","year":"1991","unstructured":"Fife, J.H.: The Kuratowski closure-complement problem. Math. Mag.\u00a064, 180\u2013182 (1991)","journal-title":"Math. Mag."},{"key":"#cr-split#-10_CR8.1","unstructured":"Gardner, B.J., Jackson, M.: The Kuratowski closure-complement theorem. New Zealand J. Math. (to appear);"},{"key":"#cr-split#-10_CR8.2","unstructured":"Preprint available at http:\/\/www.latrobe.edu.au\/mathstats\/department\/algebra-research-group\/Papers\/GJ_Kuratowski.pdf"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0012-365X(72)90057-X","volume":"2","author":"R.L. Graham","year":"1972","unstructured":"Graham, R.L., Knuth, D.E., Motzkin, T.S.: Complements and transitive closures. Discrete Math.\u00a02, 17\u201329 (1972)","journal-title":"Discrete Math."},{"key":"10_CR10","first-page":"74","volume":"7","author":"P.C. Hammer","year":"1960","unstructured":"Hammer, P.C.: Kuratowski\u2019s closure theorem. Nieuw Archief v. Wiskunde\u00a07, 74\u201380 (1960)","journal-title":"Nieuw Archief v. Wiskunde"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"182","DOI":"10.4064\/fm-3-1-182-199","volume":"3","author":"C. Kuratowski","year":"1922","unstructured":"Kuratowski, C.: Sur l\u2019op\u00e9ration $\\overline{A}$ de l\u2019analysis situs. Fund. Math.\u00a03, 182\u2013199 (1922)","journal-title":"Fund. Math."},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1307\/mmj\/1028998766","volume":"9","author":"R.C. Lyndon","year":"1962","unstructured":"Lyndon, R.C., Sch\u00fctzenberger, M.P.: The equation aM = bN cP in a free group. Michigan Math. J.\u00a09, 289\u2013298 (1962)","journal-title":"Michigan Math. J."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0012-365X(84)90055-4","volume":"50","author":"D. Peleg","year":"1984","unstructured":"Peleg, D.: A generalized closure and complement phenomenon. Discrete Math.\u00a050, 285\u2013293 (1984)","journal-title":"Discrete Math."}],"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-02737-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T04:25:09Z","timestamp":1558412709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02737-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027369","9783642027376"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02737-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}