{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T20:54:01Z","timestamp":1725656041604},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642259289"},{"type":"electronic","value":"9783642259296"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-25929-6_11","type":"book-chapter","created":{"date-parts":[[2012,1,27]],"date-time":"2012-01-27T13:36:23Z","timestamp":1327671383000},"page":"114-122","source":"Crossref","is-referenced-by-count":7,"title":["Prefix-Free Regular Languages: Closure Properties, Difference, and Left Quotient"],"prefix":"10.1007","author":[{"given":"Monika","family":"Krausov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Han, Y.-S., Salomaa, K., Wood, D.: Operational state complexity of prefix-free regular languages. Automata, Formal Languages, and Related Topics, 99\u2013115 (2009)"},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"93","DOI":"10.3233\/FI-2009-0008","volume":"90","author":"Y.-S. Han","year":"2009","unstructured":"Han, Y.-S., Salomaa, K., Wood, D.: Nondeterministic state complexity of basic operations for prefix-free regular languages. Fund. Inform.\u00a090, 93\u2013106 (2009)","journal-title":"Fund. Inform."},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-642-00982-2_34","volume-title":"Language and Automata Theory and Applications","author":"Y.-S. Han","year":"2009","unstructured":"Han, Y.-S., Salomaa, K., Yu, S.: State Complexity of Combined Operations For Prefix-Free Regular Languages. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 398\u2013409. Springer, Heidelberg (2009)"},{"key":"11_CR4","first-page":"236","volume-title":"Proc. 12th DCFS","author":"G. Jir\u00e1skov\u00e1","year":"2010","unstructured":"Jir\u00e1skov\u00e1, G., Krausov\u00e1, M.: Complexity in prefix-free regular languages. In: McQuillan, I., Pighizzini, G., Trost, B. (eds.) Proc. 12th DCFS, pp. 236\u2013244. University of Saskatchewan, Saskatoon (2010)"},{"key":"11_CR5","unstructured":"Krausov\u00e1, M.: Prefix-free languages and descriptional complexity. Bachelor thesis. P. J. \u0160af\u00e1rik University, Ko\u0161ice, Slovakia (2010) (in Slovak)"},{"key":"11_CR6","volume-title":"Introduction to the theory of computation","author":"M. Sipser","year":"1997","unstructured":"Sipser, M.: Introduction to the theory of computation. PWS Publishing Company, Boston (1997)"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(92)00011-F","volume":"125","author":"S. Yu","year":"1994","unstructured":"Yu, S., Zhuang, Q., Salomaa, K.: The state complexity of some basic operations on regular languages. Theoret. Comput. Sci.\u00a0125, 315\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Mathematical and Engineering Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25929-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T09:19:15Z","timestamp":1593595155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25929-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642259289","9783642259296"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25929-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}