{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:11:39Z","timestamp":1763467899437,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705826"},{"type":"electronic","value":"9783540705833"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70583-3_2","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"14-26","source":"Crossref","is-referenced-by-count":12,"title":["Newton\u2019s Method for \u03c9-Continuous Semirings"],"prefix":"10.1007","author":[{"given":"Javier","family":"Esparza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Kiefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Luttenberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1051\/ita:2002007","volume":"36","author":"L. Aceto","year":"2002","unstructured":"Aceto, L., \u00c9sik, Z., Ing\u00f3lfsd\u00f3ttir, A.: A fully equational proof of Parikh\u2019s theorem. Informatique Th\u00e9orique et Applications\u00a036(2), 129\u2013153 (2002)","journal-title":"Informatique Th\u00e9orique et Applications"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"2_CR3","series-title":"5126","volume-title":"ICALP 2008, Part II","author":"J. Esparza","year":"2008","unstructured":"Esparza, J., Gawlitza, T., Kiefer, S., Seidl, H.: Approximative methods for monotone systems of min-max-polynomial equations. In: Aceto, L., et al. (eds.) ICALP 2008, Part II. 5126, vol.\u00a05126, Springer, Heidelberg (2008)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-73208-2_17","volume-title":"Developments in Language Theory","author":"J. Esparza","year":"2007","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: An extension of Newton\u2019s method to \u03c9-continuous semirings. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 157\u2013168. Springer, Heidelberg (2007)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-540-70918-3_26","volume-title":"STACS 2007","author":"J. Esparza","year":"2007","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: On fixed point equations over commutative semirings. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 296\u2013307. Springer, Heidelberg (2007)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: Convergence thresholds of Newton\u2019s method for monotone polynomial equations. In: Proceedings of STACS, pp. 289\u2013300 (2008)","DOI":"10.1145\/1250790.1250822"},{"key":"2_CR7","volume-title":"Proceedings of IFIP TCS 2008","author":"J. Esparza","year":"2008","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: Solving monotone polynomial equations. In: Proceedings of IFIP TCS 2008. Springer, Heidelberg (to appear, 2008)"},{"key":"2_CR8","volume-title":"LICS 2004","author":"J. Esparza","year":"2004","unstructured":"Esparza, J., Ku\u010dera, A., Mayr, R.: Model checking probabilistic pushdown automata. In: LICS 2004. IEEE Computer Society, Los Alamitos (2004)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/978-3-540-31856-9_28","volume-title":"STACS 2005","author":"K. Etessami","year":"2005","unstructured":"Etessami, K., Yannakakis, M.: Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 340\u2013352. Springer, Heidelberg (2005)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Fernau, H., Holzer, M.: Conditional context-free languages of finite index. In: New Trends in Formal Languages, pp. 10\u201326 (1997)","DOI":"10.1007\/3-540-62844-4_2"},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0022-0000(68)80009-1","volume":"2","author":"S. Ginsburg","year":"1968","unstructured":"Ginsburg, S., Spanier, E.: Derivation-bounded languages. Journal of Computer and System Sciences\u00a02, 228\u2013250 (1968)","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/S0019-9958(71)90095-7","volume":"19","author":"J. Gruska","year":"1971","unstructured":"Gruska, J.: A few remarks on the index of context-free grammars and languages. Information and Control\u00a019, 216\u2013223 (1971)","journal-title":"Information and Control"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Hopkins, M.W., Kozen, D.: Parikh\u2019s theorem in commutative Kleene algebra. In: Logic in Computer Science, pp. 394\u2013401 (1999)","DOI":"10.1109\/LICS.1999.782634"},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/1250790.1250822","volume-title":"Proceedings of STOC","author":"S. Kiefer","year":"2007","unstructured":"Kiefer, S., Luttenberger, M., Esparza, J.: On the convergence of Newton\u2019s method for monotone systems of polynomial equations. In: Proceedings of STOC, pp. 217\u2013226. ACM, New York (2007)"},{"key":"2_CR15","series-title":"Semirings and Formal Power Series","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/978-3-642-59136-5_9","volume-title":"Handbook of Formal Languages, ch.9","author":"W. Kuich","year":"1997","unstructured":"Kuich, W.: Their Relevance to Formal Languages and Automata. In: Handbook of Formal Languages, ch.9. Semirings and Formal Power Series, vol.\u00a0\u00a01, pp. 609\u2013677. Springer, Heidelberg (1997)"},{"key":"2_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"F. Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer, Heidelberg (1999)"},{"key":"2_CR17","volume-title":"Iterative solution of nonlinear equations in several variables","author":"J.M. Ortega","year":"1970","unstructured":"Ortega, J.M., Rheinboldt, W.C.: Iterative solution of nonlinear equations in several variables. Academic Press, London (1970)"},{"issue":"4","key":"2_CR18","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R.J. Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. J. Assoc. Comput. Mach.\u00a013(4), 570\u2013581 (1966)","journal-title":"J. Assoc. Comput. Mach."},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/S0019-9958(69)90164-8","volume":"14","author":"A. Salomaa","year":"1969","unstructured":"Salomaa, A.: On the index of a context-free grammar and language. Information and Control\u00a014, 474\u2013477 (1969)","journal-title":"Information and Control"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/S0019-9958(67)91032-7","volume":"10","author":"M.K. Yntema","year":"1967","unstructured":"Yntema, M.K.: Inclusion relations among families of context-free languages. Information and Control\u00a010, 572\u2013597 (1967)","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:13:19Z","timestamp":1738325599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705826","9783540705833"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}