{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T23:12:32Z","timestamp":1648681952466},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,2,24]],"date-time":"2009-02-24T00:00:00Z","timestamp":1235433600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1007\/s00236-009-0090-y","type":"journal-article","created":{"date-parts":[[2009,2,23]],"date-time":"2009-02-23T06:04:53Z","timestamp":1235369093000},"page":"193-207","source":"Crossref","is-referenced-by-count":0,"title":["On the closure of pattern expressions languages under intersection with regular languages"],"prefix":"10.1007","volume":"46","author":[{"given":"Cezar","family":"C\u00e2mpeanu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolae","family":"Santean","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,2,24]]},"reference":[{"key":"90_CR1","doi-asserted-by":"crossref","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. Elsevier, MIT Press, Amsterdam, New York (1990)","DOI":"10.1016\/B978-0-444-88071-0.50010-2"},{"key":"90_CR2","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Angluin D.: Finding patterns common to a set of strings. J. Comput. Syst. Sci. 21, 46\u201362 (1980)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"90_CR3","first-page":"1007","volume":"14","author":"C. C\u00e2mpeanu","year":"2003","unstructured":"C\u00e2mpeanu C., Salomaa K., Yu S.: A formal study of practical regular expressions. IJFCS 14(6), 1007\u20131018 (2003)","journal-title":"IJFCS"},{"key":"90_CR4","unstructured":"C\u00e2mpeanu, C., Santean, N.: Addressing an Open Problem on Regex. Technical Report CS-2007-10, School of Computer Science, The University of Waterloo. http:\/\/www.cs.uwaterloo.ca\/research\/tr\/2007\/"},{"key":"90_CR5","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.ipl.2004.09.007","volume":"92","author":"C. C\u00e2mpeanu","year":"2004","unstructured":"C\u00e2mpeanu C., Yu S.: Pattern expressions and pattern automata. IPL 92, 267\u2013274 (2004)","journal-title":"IPL"},{"key":"90_CR6","unstructured":"Dumitrescu, S., P\u0103un, G., Salomaa, A.: Pattern Languages versus Parallel Communicating Grammar Systems. TUCS Report, vol. 42, September 1996"},{"key":"90_CR7","volume-title":"Mastering Regular Expressions","author":"J.E.F. Friedl","year":"1997","unstructured":"Friedl J.E.F.: Mastering Regular Expressions. O\u2019Reilly & Associates, Inc., Cambridge (1997)"},{"key":"90_CR8","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"2006","unstructured":"Hopcroft J.E., Motwani R., Ullman J.D.: Introduction to Automata Theory, Languages, and Computation. Addison Wesley, Reading (2006)"},{"key":"90_CR9","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0304-3975(94)00087-Y","volume":"141","author":"L. Kari","year":"1995","unstructured":"Kari L., Mateescu A., P\u0103un G., Salomaa A.: Multi-pattern languages. Theor. Comp. Sci. 141, 253\u2013268 (1995)","journal-title":"Theor. Comp. Sci."},{"issue":"1-2","key":"90_CR10","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0304-3975(00)00185-7","volume":"262","author":"S. Kobayashi","year":"2001","unstructured":"Kobayashi S., Mitrana V., P\u0103un G., Rozenberg G.: Formal Properties of PA-matching. Theor. Comp. Sci. 262(1-2), 117\u2013131 (2001)","journal-title":"Theor. Comp. Sci."},{"key":"90_CR11","unstructured":"Lesk, M.E.: Lex\u2014a Lexical Analyzer Generator. Computer Science Technical Report, vol. 39, AT&T Bell Laboratories, Murray Hill (1975)"},{"key":"90_CR12","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0020-0190(00)00159-9","volume":"77","author":"C. Mart\u00edn-Vide","year":"2001","unstructured":"Mart\u00edn-Vide C., Mitrana V.: Some Undecidable Problems for Parallel Communicating Finite Automata Systems. Inf. Process. Lett. 77, 239\u2013245 (2001)","journal-title":"Inf. Process. Lett."},{"key":"90_CR13","unstructured":"Mart\u00edn-Vide, C., Mitrana, V.: Remarks on Arbitrary Multiple Pattern Interpretations. Inf. Process. Lett. (in press), available online 24 October (2006)"},{"issue":"2","key":"90_CR14","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)00258-4","volume":"154","author":"V. Mitrana","year":"1996","unstructured":"Mitrana V., P\u0103un G., Rozenberg G., Salomaa A.: Pattern systems. Theor Comp. Sci. 154(2), 183\u2013201 (1996)","journal-title":"Theor Comp. Sci."},{"key":"90_CR15","volume-title":"Theory of Automata","author":"A. Salomaa","year":"1969","unstructured":"Salomaa A.: Theory of Automata. Pergamon Press, Oxford (1969)"},{"key":"90_CR16","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa A.: Formal Languages. Academic Press, New York (1973)"},{"key":"90_CR17","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume-title":"Handbook of Formal Languages","author":"S. Yu","year":"1997","unstructured":"Yu S.: Regular Languages. In: Salomaa, A., Rozenberg, G.(eds) Handbook of Formal Languages, pp. 41\u2013110. Springer, Heidelberg (1997)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-009-0090-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-009-0090-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-009-0090-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:41:55Z","timestamp":1558705315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-009-0090-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,24]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["90"],"URL":"https:\/\/doi.org\/10.1007\/s00236-009-0090-y","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,24]]}}}