{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:08Z","timestamp":1760202608409,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_28","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T18:06:19Z","timestamp":1267553179000},"page":"340-352","source":"Crossref","is-referenced-by-count":50,"title":["Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations"],"prefix":"10.1007","author":[{"given":"Kousha","family":"Etessami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihalis","family":"Yannakakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","first-page":"304","volume-title":"Computer Aided Verification","author":"R. Alur","year":"2001","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Analysis of recursive state machines. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 304\u2013313. Springer, Heidelberg (2001)"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Abney, S., McAllester, D., Pereira, F.: Relating probabilistic grammars and automata. In: Proc. 37th Ann. Ass. for Comp. Linguistics, pp. 542\u2013549 (1999)","DOI":"10.3115\/1034678.1034759"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR\u201997: Concurrency Theory","author":"A. Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: App\u2019s to model checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 135\u2013150. Springer, Heidelberg (1997)"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/3-540-48224-5_54","volume-title":"Automata, Languages and Programming","author":"M. Benedikt","year":"2001","unstructured":"Benedikt, M., Godefroid, P., Reps, T.: Model checking of unrestricted hierarchical state machines. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 652\u2013666. Springer, Heidelberg (2001)"},{"issue":"6","key":"28_CR5","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1145\/235809.235813","volume":"43","author":"S. Basu","year":"1996","unstructured":"Basu, S., Pollack, R., Roy, M.F.: On the combinatorial and algebraic complexity of quantifier elimination. J. of the ACM\u00a043(6), 1002\u20131045 (1996)","journal-title":"J. of the ACM"},{"key":"28_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05355-3","volume-title":"Algorithms in Real Algebraic Geometry","author":"S. Basu","year":"2003","unstructured":"Basu, S., Pollack, F., Roy, M.F.: Algorithms in Real Algebraic Geometry. Springer, Heidelberg (2003)"},{"issue":"5","key":"28_CR7","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1109\/T-C.1973.223746","volume":"22","author":"T.L. Booth","year":"1973","unstructured":"Booth, T.L., Thompson, R.A.: Applying probability measures to abstract languages. IEEE Transactions on Computers\u00a022(5), 442\u2013450 (1973)","journal-title":"IEEE Transactions on Computers"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Canny, J.: Some algebraic and geometric computations in PSPACE. In: Prof. of 20th ACM STOC, pp. 460\u2013467 (1988)","DOI":"10.1145\/62212.62257"},{"key":"28_CR9","unstructured":"Chi, Z., Geman, S.: Estimation of probabilistic context-free grammars. In: Computational Linguistics (1997)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/10722167_20","volume-title":"Computer Aided Verification","author":"J. Esparza","year":"2000","unstructured":"Esparza, J., Hansel, D., Rossmanith, P., Schwoon, S.: Efficient algorithms for model checking pushdown systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 232\u2013247. Springer, Heidelberg (2000)"},{"key":"28_CR11","unstructured":"Esparza, J., Ku\u010dera, A.: Personal communication (2004)"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Esparza, J., Ku\u010dera, A., Mayr, R.: Model checking probabilistic pushdown automata. In: LICS 2004 (2004)","DOI":"10.1109\/LICS.2004.1319596"},{"key":"28_CR13","unstructured":"Everett, C.J., Ulam, S.: Multiplicative systems, part i., ii, and iii. Technical Report 683,690,707, Los Alamos Scientific Laboratory (1948)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Etessami, K., Yannakakis, M.: Algorithmic verification of recursive probabilistic systems. Technical report, School of Informatics, U. of Edinburgh (2004) (submitted)","DOI":"10.1007\/978-3-540-31980-1_17"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Etessami, K., Yannakakis, M.: Recursive Markov chains, stochastic grammars, and monotone systems of non-linear equations. Technical report, School of Informatics, University of Edinburgh (2004) (Full paper)","DOI":"10.1007\/978-3-540-31856-9_28"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S.: Some NP-complete geometric problems. In: 8th ACM STOC, pp. 10\u201322 (1976)","DOI":"10.1145\/800113.803626"},{"key":"28_CR17","volume-title":"Lectures on Pattern Theory","author":"U. Grenander","year":"1976","unstructured":"Grenander, U.: Lectures on Pattern Theory, vol.\u00a01. Springer, Heidelberg (1976)"},{"key":"28_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-51866-9","volume-title":"The Theory of Branching Processes","author":"T.E. Harris","year":"1963","unstructured":"Harris, T.E.: The Theory of Branching Processes. Springer, Heidelberg (1963)"},{"key":"28_CR19","volume-title":"Branching Processes with Biological Applications","author":"P. Jagers","year":"1975","unstructured":"Jagers, P.: Branching Processes with Biological Applications. Wiley, Chichester (1975)"},{"key":"28_CR20","first-page":"783","volume":"56","author":"A.N. Kolmogorov","year":"1947","unstructured":"Kolmogorov, A.N., Sevastyanov, B.A.: The calculation of final probabilities for branching random processes. Dokaldy\u00a056, 783\u2013786 (1947) (Russian)","journal-title":"Dokaldy"},{"key":"28_CR21","volume-title":"The Theory of Matrices","author":"P. Lancaster","year":"1985","unstructured":"Lancaster, P., Tismenetsky, M.: The Theory of Matrices, 2nd edn. Academic Press, London (1985)","edition":"2"},{"key":"28_CR22","unstructured":"Malajovich, G.: An effective version of Kronecker\u2019s theorem on simultaneous diophantine equations. Technical report, City U. of Hong Kong (1996)"},{"key":"28_CR23","volume-title":"Foundations of Statistical Natural Language Processing","author":"C. Manning","year":"1999","unstructured":"Manning, C., Sch\u00fctze, H.: Foundations of Statistical Natural Language Processing. MIT Press, Cambridge (1999)"},{"key":"28_CR24","volume-title":"Iterative solution of nonlinear equations in several variables","author":"J.M. Ortega","year":"1970","unstructured":"Ortega, J.M., Rheinbolt, W.C.: Iterative solution of nonlinear equations in several variables. Academic Press, London (1970)"},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals. parts i,ii, iii. J. of Symbolic Computation, 255\u2013352 (1992)","DOI":"10.1016\/S0747-7171(10)80005-7"},{"key":"28_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2272-7","volume-title":"Introduction to Numerical Analysis","author":"J. Stoer","year":"1993","unstructured":"Stoer, J., Bulirsch, R.: Introduction to Numerical Analysis. Springer, Heidelberg (1993)"},{"issue":"23","key":"28_CR27","doi-asserted-by":"publisher","first-page":"5112","DOI":"10.1093\/nar\/22.23.5112","volume":"22","author":"Y. Sakakibara","year":"1994","unstructured":"Sakakibara, Y., Brown, M., Hughey, R., Mian, I.S., Sjolander, K., Underwood, R., Haussler, D.: Stochastic context-free grammars for tRNA modeling. Nucleic Acids Research\u00a022(23), 5112\u20135120 (1994)","journal-title":"Nucleic Acids Research"},{"key":"28_CR28","first-page":"47","volume":"6","author":"B.A. Sevastyanov","year":"1951","unstructured":"Sevastyanov, B.A.: The theory of branching processes. Uspehi Mathemat. Nauk\u00a06, 47\u201399 (1951) (in Russian)","journal-title":"Uspehi Mathemat. Nauk"},{"key":"28_CR29","doi-asserted-by":"crossref","unstructured":"Tiwari, P.: A problem that is easier to solve on the unit-cost algebraic ram. Journal of Complexity, 393\u2013397 (1992)","DOI":"10.1016\/0885-064X(92)90003-T"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T23:09:56Z","timestamp":1739920196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}