{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:54:21Z","timestamp":1725555261661},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130885"},{"type":"electronic","value":"9783642130892"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13089-2_26","type":"book-chapter","created":{"date-parts":[[2010,5,7]],"date-time":"2010-05-07T08:05:27Z","timestamp":1273219527000},"page":"309-320","source":"Crossref","is-referenced-by-count":1,"title":["The Inclusion Problem for Regular Expressions"],"prefix":"10.1007","author":[{"given":"Dag","family":"Hovland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"26_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1109\/T-C.1971.223204","volume":"20","author":"R. Book","year":"1971","unstructured":"Book, R., Even, S., Greibach, S., Ott, G.: Ambiguity in graphs and expressions. IEEE Transactions on Computers\u00a0c-20(2), 149\u2013153 (1971)","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"26_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0304-3975(93)90287-4","volume":"120","author":"A. Br\u00fcggemann-Klein","year":"1993","unstructured":"Br\u00fcggemann-Klein, A.: Regular expressions into finite automata. Theoretical Computer Science\u00a0120(2), 197\u2013213 (1993)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"26_CR3","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1006\/inco.1997.2688","volume":"140","author":"A. Br\u00fcggemann-Klein","year":"1998","unstructured":"Br\u00fcggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Information and Computation\u00a0140(2), 229\u2013253 (1998)","journal-title":"Information and Computation"},{"issue":"4","key":"26_CR4","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J.A. Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. ACM\u00a011(4), 481\u2013494 (1964)","journal-title":"J. ACM"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-85762-4_7","volume-title":"Theoretical Aspects of Computing - ICTAC 2008","author":"H. Chen","year":"2008","unstructured":"Chen, H., Chen, L.: Inclusion test algorithms for one-unambiguous regular expressions. In: Fitzgerald, J.S., Haxthausen, A.E., Yenig\u00fcn, H. (eds.) ICTAC 2008. LNCS, vol.\u00a05160, pp. 96\u2013110. Springer, Heidelberg (2008)"},{"issue":"5","key":"26_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"V.M. Glushkov","year":"1961","unstructured":"Glushkov, V.M.: The abstract theory of automata. Russian Mathematical Surveys\u00a016(5), 1\u201353 (1961)","journal-title":"Russian Mathematical Surveys"},{"key":"26_CR7","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/1053468.1053470","volume":"27","author":"H. Hosoya","year":"2005","unstructured":"Hosoya, H., Vouillon, J., Pierce, B.C.: Regular expression types for XML. ACM Trans. Program. Lang. Syst.\u00a027(1), 46\u201390 (2005)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"9","author":"R. McNaughton","year":"1960","unstructured":"McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IRE Transactions on Electronic Computers\u00a09, 39\u201347 (1960)","journal-title":"IRE Transactions on Electronic Computers"},{"key":"26_CR10","first-page":"125","volume-title":"Proceedings of FOCS","author":"A.R. Meyer","year":"1972","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: Proceedings of FOCS, pp. 125\u2013129. IEEE, Los Alamitos (1972)"},{"issue":"4","key":"26_CR11","doi-asserted-by":"publisher","first-page":"541","DOI":"10.2307\/2033204","volume":"9","author":"A. Nerode","year":"1958","unstructured":"Nerode, A.: Linear automaton transformations. Proceedings of the American Mathematical Society\u00a09(4), 541\u2013544 (1958)","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"1","key":"26_CR12","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A. Salomaa","year":"1966","unstructured":"Salomaa, A.: Two complete axiom systems for the algebra of regular events. J. ACM\u00a013(1), 158\u2013169 (1966)","journal-title":"J. ACM"}],"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-13089-2_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:54:35Z","timestamp":1619769275000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13089-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130885","9783642130892"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13089-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}