{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:16:42Z","timestamp":1725466602132},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316524"},{"type":"electronic","value":"9783642316531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31653-1_30","type":"book-chapter","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T05:51:39Z","timestamp":1342245099000},"page":"332-343","source":"Crossref","is-referenced-by-count":2,"title":["Checking Determinism of Regular Expressions with Counting"],"prefix":"10.1007","author":[{"given":"Haiming","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"30_CR1","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":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/3-540-55210-3_182","volume-title":"STACS 92","author":"A. Br\u00fcggemann-Klein","year":"1992","unstructured":"Br\u00fcggemann-Klein, A., Wood, D.: Deterministic Regular Languages. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol.\u00a0577, pp. 173\u2013184. Springer, Heidelberg (1992)"},{"issue":"2","key":"30_CR3","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1006\/inco.1997.2695","volume":"142","author":"A. Br\u00fcggemann-Klein","year":"1998","unstructured":"Br\u00fcggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Information and Computation\u00a0142(2), 182\u2013206 (1998)","journal-title":"Information and Computation"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-20291-9_31","volume-title":"Web Technologies and Applications","author":"H. Chen","year":"2011","unstructured":"Chen, H., Lu, P.: Assisting the Design of XML Schema: Diagnosing Nondeterministic Content Models. In: Du, X., Fan, W., Wang, J., Peng, Z., Sharaf, M.A. (eds.) APWeb 2011. LNCS, vol.\u00a06612, pp. 301\u2013312. Springer, Heidelberg (2011)"},{"issue":"1","key":"30_CR5","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1137\/100814196","volume":"41","author":"W. Gelade","year":"2012","unstructured":"Gelade, W., Gyssens, M., Martens, W.: Regular expressions with counting: weak versus strong determinism. SIAM J. Comput.\u00a041(1), 160\u2013190 (2012)","journal-title":"SIAM J. Comput."},{"key":"30_CR6","unstructured":"Gelade, W., Neven, F.: Succinctness of the complement and intersection of regular expressions. In: STACS 2008, pp. 325\u2013336 (2008)"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-28332-1_27","volume-title":"Language and Automata Theory and Applications","author":"D. Hovland","year":"2012","unstructured":"Hovland, D.: The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol.\u00a07183, pp. 313\u2013324. Springer, Heidelberg (2012)"},{"issue":"3","key":"30_CR8","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1016\/j.is.2010.10.001","volume":"36","author":"P. Kilpel\u00e4inen","year":"2011","unstructured":"Kilpel\u00e4inen, P.: Checking determinism of XML Schema content models in optimal time. Informat. Systems\u00a036(3), 596\u2013617 (2011)","journal-title":"Informat. Systems"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1145\/1030397.1030441","volume-title":"DocEng 2004","author":"P. Kilpel\u00e4inen","year":"2004","unstructured":"Kilpel\u00e4inen, P., Tuhkanen, R.: Towards efficient implementation of XML Schema content models. In: DocEng 2004, pp. 239\u2013241. ACM, New York (2004)"},{"issue":"6","key":"30_CR10","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"},{"issue":"3","key":"30_CR11","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s00778-005-0169-1","volume":"16","author":"C. Koch","year":"2007","unstructured":"Koch, C., Scherzinger, S.: Attribute grammars for scalable query processing on XML streams. The VLDB Journal\u00a016(3), 317\u2013342 (2007)","journal-title":"The VLDB Journal"},{"key":"30_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1007\/978-3-540-28629-5_70","volume-title":"Mathematical Foundations of Computer Science 2004","author":"W. Martens","year":"2004","unstructured":"Martens, W., Neven, F., Schwentick, T.: Complexity of Decision Problems for Simple Regular Expressions. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 889\u2013900. Springer, Heidelberg (2004)"},{"issue":"3","key":"30_CR13","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1145\/1166074.1166076","volume":"31","author":"W. Martens","year":"2006","unstructured":"Martens, W., Neven, F., Schwentick, T., Bex, G.J.: Expressiveness and complexity of XML Schema. ACM Transactions on Database Systems\u00a031(3), 770\u2013813 (2006)","journal-title":"ACM Transactions on Database Systems"},{"key":"30_CR14","unstructured":"Sperberg-McQueen, C.M.: Notes on finite state automata with counters (2004), \n                    \n                      http:\/\/www.w3.org\/XML\/2004\/05\/msm-cfa.html"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31653-1_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:41:35Z","timestamp":1620114095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31653-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316524","9783642316531"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31653-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}