{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:20:25Z","timestamp":1787498425223,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642034657","type":"print"},{"value":"9783642034664","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-03466-4_15","type":"book-chapter","created":{"date-parts":[[2009,8,3]],"date-time":"2009-08-03T03:20:54Z","timestamp":1249269654000},"page":"231-245","source":"Crossref","is-referenced-by-count":16,"title":["Regular Expressions with Numerical Constraints and Automata with Counters"],"prefix":"10.1007","author":[{"given":"Dag","family":"Hovland","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"The Open Group: The Open Group Base Specifications Issue 6, IEEE Std 1003.1. 2 edn. (1997)"},{"key":"15_CR2","unstructured":"GNU: GNU grep manual"},{"key":"15_CR3","unstructured":"Fallside, D.C.: XML Schema part 0: Primer, W3C recommendation. Technical report, World Wide Web Consortium (W3C) (2001)"},{"key":"15_CR4","unstructured":"Kilpel\u00e4inen, P., Tuhkanen, R.: Regular expressions with numerical occurrence indicators - preliminary results. In: Kilpel\u00e4inen, P., P\u00e4ivinen, N. (eds.) SPLST, pp. 163\u2013173. University of Kuopio, Department of Computer Science (2003)"},{"issue":"2","key":"15_CR5","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"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/11965893_19","volume-title":"Database Theory \u2013 ICDT 2007","author":"W. Gelade","year":"2006","unstructured":"Gelade, W., Martens, W., Neven, F.: Optimizing schema languages for XML: Numerical constraints and interleaving. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol.\u00a04353, pp. 269\u2013283. Springer, Heidelberg (2006)"},{"issue":"6","key":"15_CR7","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1016\/j.ic.2006.12.003","volume":"205","author":"P. Kilpel\u00e4inen","year":"2007","unstructured":"Kilpel\u00e4inen, P., Tuhkanen, R.: One-unambiguity of regular expressions with numeric occurrence indicators. Information and Computation\u00a0205(6), 890\u2013916 (2007)","journal-title":"Information and Computation"},{"key":"15_CR8","volume-title":"Term Rewriting Systems","year":"2003","unstructured":"Bezem, M., Klop, J.W., de Vrijer, R. (eds.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"},{"issue":"2","key":"15_CR9","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":"5","key":"15_CR10","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":"15_CR11","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)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Kleene, S.C.: Representation of events in nerve sets and finite automata. Automata Studies, 3\u201341 (1956)","DOI":"10.1515\/9781400882618-002"},{"key":"15_CR13","first-page":"239","volume-title":"ACM Symposium on Document Engineering","author":"P. Kilpel\u00e4inen","year":"2004","unstructured":"Kilpel\u00e4inen, P., Tuhkanen, R.: Towards efficient implementation of XML schema content models. In: Munson, E.V., Vion-Dury, J.Y. (eds.) ACM Symposium on Document Engineering, pp. 239\u2013241. ACM, New York (2004)"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1145\/1458082.1458135","volume-title":"CIKM","author":"G. Ghelli","year":"2008","unstructured":"Ghelli, G., Colazzo, D., Sartiani, C.: Linear time membership in a class of regular expressions with interleaving and counting. In: Shanahan, J.G., Amer-Yahia, S., Manolescu, I., Zhang, Y., Evans, D.A., Kolcz, A., Choi, K.S., Chowdhury, A. (eds.) CIKM, pp. 389\u2013398. ACM, New York (2008)"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/3-540-44881-0_18","volume-title":"Rewriting Techniques and Applications","author":"S. Dal-Zilio","year":"2003","unstructured":"Dal-Zilio, S., Lugiez, D.: Xml schema, tree logic and sheaves automata. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 246\u2013263. Springer, Heidelberg (2003)"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Laurikari, V.: NFAs with tagged transitions, their conversion to deterministic automata and application to regular expressions. In: SPIRE, pp. 181\u2013187 (2000)","DOI":"10.1109\/SPIRE.2000.878194"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BFb0023820","volume-title":"LATIN \u201992","author":"A. Br\u00fcggemann-Klein","year":"1992","unstructured":"Br\u00fcggemann-Klein, A.: Regular expressions into finite automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol.\u00a0583, pp. 87\u201398. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing - ICTAC 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03466-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T16:36:08Z","timestamp":1558456568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03466-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034657","9783642034664"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03466-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}