{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:36:22Z","timestamp":1725730582721},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387708"},{"type":"electronic","value":"9783642387715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38771-5_31","type":"book-chapter","created":{"date-parts":[[2013,6,9]],"date-time":"2013-06-09T22:16:25Z","timestamp":1370816185000},"page":"350-361","source":"Crossref","is-referenced-by-count":0,"title":["Deciding Determinism of Unary Languages Is coNP-Complete"],"prefix":"10.1007","author":[{"given":"Ping","family":"Lu","sequence":"first","affiliation":[]},{"given":"Feifei","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Haiming","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Bex, G.J., Gelade, W., Martens, W., Neven, F.: Simplifying XML schema: effortless handling of nondeterministic regular expressions. In: SIGMOD 2009, pp. 731\u2013743 (2009)","key":"31_CR1","DOI":"10.1145\/1559845.1559922"},{"unstructured":"Bickel, K., Firrisa, M., Ortiz, J., Pueschel, K.: Constructions of Coverings of the Integers: Exploring an Erd\u0151s problem. Summer Math Institute, Cornell University (2008)","key":"31_CR2"},{"issue":"2","key":"31_CR3","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":"31_CR4","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":"31_CR5","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)"},{"key":"31_CR6","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)","edition":"2"},{"key":"31_CR7","first-page":"113","volume":"2","author":"P. Erd\u0151s","year":"1950","unstructured":"Erd\u0151s, P.: On integers of the form 2\n                    k\n                  \u2009+\u2009p and some related problems. Summa Brasil. Math.\u00a02, 113\u2013123 (1950)","journal-title":"Summa Brasil. Math."},{"unstructured":"Garrey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman (1979)","key":"31_CR8"},{"issue":"1","key":"31_CR9","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."},{"unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: a foundation for computer science, 2nd edn. Addison-Wesley (1994)","key":"31_CR10"},{"doi-asserted-by":"crossref","unstructured":"Groz, B., Maneth, S., Staworko, S.: Deterministic regular expressions in linear time. In: PODS 2012, pp. 49\u201360 (2012)","key":"31_CR11","DOI":"10.1145\/2213556.2213566"},{"key":"31_CR12","series-title":"Problem Books in Math.","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-26677-0","volume-title":"Unsolved problems in Number Theory","author":"R.K. Guy","year":"2004","unstructured":"Guy, R.K.: Unsolved problems in Number Theory, 3rd edn. Problem Books in Math. Springer, New York (2004)","edition":"3"},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-14455-4_3","volume-title":"Developments in Language Theory","author":"M. Holzer","year":"2010","unstructured":"Holzer, M., Kutrib, M.: The complexity of regular(-like) expressions. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol.\u00a06224, pp. 16\u201330. Springer, Heidelberg (2010)"},{"issue":"3","key":"31_CR14","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":"31_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32589-2_56","volume-title":"Mathematical Foundations of Computer Science 2012","author":"K. Losemann","year":"2012","unstructured":"Losemann, K., Martens, W., Niewerth, M.: Descriptional complexity of deterministic regular expressions. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 643\u2013654. Springer, Heidelberg (2012)"},{"key":"31_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-15349-5_12","volume-title":"Reachability Problems","author":"Z. Sawa","year":"2010","unstructured":"Sawa, Z.: Efficient construction of semilinear representations of languages accepted by unary NFA. In: Ku\u010dera, A., Potapov, I. (eds.) RP 2010. LNCS, vol.\u00a06227, pp. 176\u2013182. Springer, Heidelberg (2010)"},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/11672142_35","volume-title":"STACS 2006","author":"G. Schnitger","year":"2006","unstructured":"Schnitger, G.: Regular expressions and NFAs without \u03b5-transitions. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 432\u2013443. Springer, Heidelberg (2006)"},{"key":"31_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-6290-9","volume-title":"Counterexamples in topology","author":"L.A. Steen","year":"1978","unstructured":"Steen, L.A., Seebach, J.A.: Counterexamples in topology, 2nd edn. Springer, New York (1978)","edition":"2"},{"doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time: preliminary report. In: STOC 1973, pp. 1\u20139 (1973)","key":"31_CR19","DOI":"10.1145\/800125.804029"},{"unstructured":"van der Vlist, E.: XML Schema. O\u2019Reilly (2002)","key":"31_CR20"},{"unstructured":"World Wide Web Consortium, \n                    \n                      http:\/\/www.w3.org\/wiki\/UniqueParticleAttribution","key":"31_CR21"},{"issue":"2","key":"31_CR22","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(92)00011-F","volume":"125","author":"S. Yu","year":"1994","unstructured":"Yu, S., Zhuang, Q., Salomaa, K.: The state complexities of some basic operations on regular langauges. Theoretical Computer Science\u00a0125(2), 315\u2013328 (1994)","journal-title":"Theoretical Computer Science"}],"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-38771-5_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T20:32:24Z","timestamp":1557779544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38771-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387708","9783642387715"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38771-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}