{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T07:30:15Z","timestamp":1770276615720,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642009815","type":"print"},{"value":"9783642009822","type":"electronic"}],"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-00982-2_24","type":"book-chapter","created":{"date-parts":[[2009,3,30]],"date-time":"2009-03-30T15:51:54Z","timestamp":1238428314000},"page":"279-289","source":"Crossref","is-referenced-by-count":16,"title":["On Extended Regular Expressions"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Carle","sequence":"first","affiliation":[]},{"given":"Paliath","family":"Narendran","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1142\/S012905410300214X","volume":"14","author":"C. C\u00e2mpeanu","year":"2003","unstructured":"C\u00e2mpeanu, C., Salomaa, K., Yu, S.: A formal study of practical regular expressions. Int. J. Found. Comput. Sci.\u00a014, 1007\u20131018 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.ipl.2005.05.003","volume":"95","author":"B. Nagy","year":"2005","unstructured":"Nagy, B.: On the language equivalence of NE star-patterns. Inf. Process. Lett.\u00a095, 396\u2013400 (2005)","journal-title":"Inf. Process. Lett."},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0304-3975(94)00087-Y","volume":"141","author":"L. Kari","year":"1995","unstructured":"Kari, L., Mateescu, A., Paun, G., Salomaa, A.: Multi-pattern languages. Theor. Comput. Sci.\u00a0141, 253\u2013268 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR4","series-title":"Algorithms and Complexity (A)","first-page":"255","volume-title":"Handbook of Theoretical Computer Science","author":"A.V. Aho","year":"1990","unstructured":"Aho, A.V.: Algorithms for finding patterns in strings. In: Handbook of Theoretical Computer Science. Algorithms and Complexity (A), vol.\u00a0A, pp. 255\u2013300. MIT Press, Cambridge (1990)"},{"key":"24_CR5","unstructured":"Gallier, J.H.: Logic for Computer Science: Foundations of Automatic Theorem Proving. Harper & Row (1986)"},{"key":"24_CR6","first-page":"607","volume":"41","author":"S. Dumitrescu","year":"1996","unstructured":"Dumitrescu, S., P\u0103un, G., Salomaa, A.: Languages associated to finite and infinite patterns. Rev. Roum. Math. Pures Appl.\u00a041, 607\u2013625 (1996)","journal-title":"Rev. Roum. Math. Pures Appl."},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1137\/S009753979528682X","volume":"29","author":"E. Bertsch","year":"1999","unstructured":"Bertsch, E., Nederhof, M.J.: Regular closure of deterministic languages. SIAM J. Comput.\u00a029, 81\u2013102 (1999)","journal-title":"SIAM J. Comput."},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"2152","DOI":"10.1016\/j.dam.2007.05.021","volume":"155","author":"M. Kutrib","year":"2007","unstructured":"Kutrib, M., Malcher, A.: Finite turns and the regular closure of linear context-free languages. Discrete Applied Mathematics\u00a0155, 2152\u20132164 (2007)","journal-title":"Discrete Applied Mathematics"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/jcss.1995.1006","volume":"50","author":"T. Jiang","year":"1995","unstructured":"Jiang, T., Salomaa, A., Salomaa, K., Yu, S.: Decision problems for patterns. J. Comput. Syst. Sci.\u00a050, 53\u201363 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR10","unstructured":"Nagy, B.: A normal form for regular expressions. In: Eighth International Conference on Developments in Language Theory (DLT 2004), Auckland, New Zealand (2004), \n                    \n                      www.cs.auckland.ac.nz\/CDMTCS\/researchreports\/252dlt04.pdf"},{"key":"24_CR11","unstructured":"Carle, B., Narendran, P., Scheriff, C.: On extended regular expressions. In: Twenty-first International Workshop on Unification (UNIF 2007), Paris, France (June 2007)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00982-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T06:16:44Z","timestamp":1538806604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00982-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642009815","9783642009822"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00982-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}