{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:36:19Z","timestamp":1742913379803,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030261757"},{"type":"electronic","value":"9783030261764"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26176-4_39","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T23:02:56Z","timestamp":1563922976000},"page":"469-477","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["LIKE Patterns and Complexity"],"prefix":"10.1007","author":[{"given":"Holger","family":"Petersen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,21]]},"reference":[{"key":"39_CR1","unstructured":"Oracle$$^{{\\textregistered }}$$ Database SQL Reference 10g Release 1. https:\/\/docs.oracle.com\/cd\/B13789_01\/server.101\/b10759\/conditions016.htm"},{"key":"39_CR2","series-title":"Algorithms and Complexity","first-page":"255","volume-title":"Handbook of Theoretical Computer Science","author":"AV Aho","year":"1990","unstructured":"Aho, A.V.: Algorithms for finding patterns in strings. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Algorithms and Complexity, vol. A, pp. 255\u2013300. MIT Press, Cambridge (1990)"},{"key":"39_CR3","first-page":"37","volume":"16","author":"JA Brzozowski","year":"1978","unstructured":"Brzozowski, J.A., Knast, R.: The dot-depth hierarchy of star-free languages is infinite. JCSS 16, 37\u201355 (1978)","journal-title":"JCSS"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Libkin, L., Schwentick, T., Segoufin, L.: String operations in query languages. In: Buneman, P. (ed.) Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Santa Barbara, California, USA, 21\u201323 May 2001, pp. 183\u2013194 (2001)","DOI":"10.1145\/375551.375578"},{"key":"39_CR5","first-page":"1","volume":"5","author":"RS Cohen","year":"1971","unstructured":"Cohen, R.S., Brzozowski, J.A.: Dot-depth of star-free events. JCSS 5, 1\u201316 (1971)","journal-title":"JCSS"},{"key":"39_CR6","unstructured":"Freydenberger, D.D.: Extended regular expressions: succinctness and decidability. In: Schwentick, T., D\u00fcrr, C. (eds.) Proceedings of the 28th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2011), Leibniz International Proceedings in Informatics, pp. 507\u2013518. Schloss Dagstuhl: Leibniz-Zentrum f\u00fcr Informatik. Dagstuhl Publishing, Germany (2011)"},{"key":"39_CR7","unstructured":"F\u00fcrer, M.: Nicht-elementare untere Schranken in der Automaten-Theorie. Ph.D. thesis, ETH Z\u00fcrich (1978)"},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"M Furst","year":"1984","unstructured":"Furst, M., Saxe, J.B., Sipser, M.: Parity, circuits, and the polynomial-time hierarchy. Math. Syst. Theory 17, 13\u201327 (1984)","journal-title":"Math. Syst. Theory"},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0020-0190(05)80006-7","volume":"40","author":"T Jiang","year":"1991","unstructured":"Jiang, T., Ravikumar, B.: A note on the space complexity of some decision problems for finite automata. Inf. Process. Lett. 40, 25\u201331 (1991)","journal-title":"Inf. Process. Lett."},{"key":"39_CR10","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/322033.322037","volume":"24","author":"N Lynch","year":"1977","unstructured":"Lynch, N.: Log space recognition and translation of parenthesis languages. J. Assoc. Comput. Mach. 24, 583\u2013590 (1977)","journal-title":"J. Assoc. Comput. Mach."},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: Proceedings of the 13th Annual IEEE Symposium on Switching and Automata Theory, College Park (Maryland), pp. 125\u2013129 (1972)","DOI":"10.1109\/SWAT.1972.29"},{"key":"39_CR12","unstructured":"Petersen, H.: Decision problems for generalized regular expressions. In: Proceedings of the 2nd International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, London (Ontario), pp. 22\u201329 (2000)"},{"key":"39_CR13","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"2006","unstructured":"Sipser, M.: Introduction to the Theory of Computation, 2nd edn. Thomson, Boston (2006)","edition":"2"},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: Proceedings of the 5th ACM Symposium on Theory of Computing (STOC 1973), Austin (Texas), pp. 1\u20139 (1973)","DOI":"10.1145\/800125.804029"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26176-4_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:14:10Z","timestamp":1709824450000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26176-4_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030261757","9783030261764"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26176-4_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ictt.xidian.edu.cn\/COCOON2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}