Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations

Lecture Notes in Computer Science

Volumn 3404, Issue , 2005, Pages 340-352

  Etessami, Kousha ^a   Yannakakis, Mihalis ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; PROBABILISTIC LOGICS; RANDOM PROCESSES; RECURSIVE FUNCTIONS;

MONOTONE SYSTEMS; PROBABILISTIC PUSHDOWN SYSTEMS; RECURSIVE MARKOV CHAINS (RMC); RECURSIVE STATE MACHINES;

MARKOV PROCESSES;

EID: 24144446398     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31856-9_28     Document Type: Conference Paper

References (29)

1. R. Alur, K. Etessami, and M. Yannakakis. Analysis of recursive state machines. In Proc. of 13th Int. Conf. on Computer-Aided Verification, pp. 304-313, 2001.
2. S. Abney, D. McAllester, and F. Pereira. Relating probabilistic grammars and automata. Proc. 37th Ann. Ass. for Comp. Linguistics, pp. 542-549, 1999.
3. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: App's to model checking. In CONCUR'97, pp. 135-150, 1997.
4. M. Benedikt, P. Godefroid, and T. Reps. Model checking of unrestricted hierarchical state machines. In Proc. of ICALP'01, LNCS 2076, pp. 652-666, 2001.
5. S. Basu, R. Pollack, and M. F. Roy. On the combinatorial and algebraic complexity of quantifier elimination. J. of the ACM, 43(6):1002-1045, 1996.
6. S. Basu, F. Pollack, and M. F. Roy. Algorithms in Real Algebraic Geometry. Springer, 2003.
7. T. L. Booth and R. A. Thompson. Applying probability measures to abstract languages. IEEE Transactions on Computers, 22(5):442-450, 1973.
8. J. Canny. Some algebraic and geometric computations in PSPACE. In Prof. of 20th ACM STOC, pp. 460-467, 1988.
9. Z. Chi and S. Geman. Estimation of probabilistic context-free grammars. Computational Linguistics, 1997.
10. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In 12th CAV, LNCS 1855, pp. 232-247, 2000.
11. J. Esparza and A. Kučera. personal communication, 2004.
12. Javier Esparza, Antonín Kučera, and Richard Mayr. Model checking probabilistic pushdown automata. In LICS 2004, 2004.
13. C. J. Everett and S. Ulam. Multiplicative systems, part i., ii, and iii. Technical Report 683,690,707, Los Alamos Scientific Laboratory, 1948.
14. K. Etessami and M. Yannakakis. Algorithmic verification of recursive probabilistic systems. Technical report, School of Informatics, U. of Edinburgh, 2004. Submitted.
15. K. Etessami and M. Yannakakis. Recursive Markov chains, stochastic grammars, and monotone systems of non-linear equations. Technical report, School of Informatics, University of Edinburgh, 2004. (Full paper).
16. M. R. Garey, R. L. Graham, and D. S. Johnson. Some NP-complete geometric problems. In 8th ACM STOC, pp. 10-22, 1976.
17. U. Grenander. Lectures on Pattern Theory, Vol. 1. Springer-Verlag, 1976.
18. T. E. Harris. The Theory of Branching Processes. Springer-Verlag, 1963.
19. P. Jagers. Branching Processes with Biological Applications. Wiley, 1975.
20. A. N. Kolmogorov and B. A. Sevastyanov. The calculation of final probabilities for branching random processes. Dokaldy, 56:783-786, 1947. (Russian).
21. P. Lancaster and M. Tismenetsky. The Theory of Matrices. Academic Press, 2nd edition, 1985.
22. G. Malajovich. An effective version of Kronecker's theorem on simultaneous diophantine equations. Technical report, City U. of Hong Kong, 1996.
23. C. Manning and H. Schütze. Foundations of Statistical Natural Language Processing. MIT Press, 1999.
24. J. M. Ortega and W.C. Rheinbolt. Iterative solution of nonlinear equations in several variables. Academic Press, 1970.
25. J. Renegar. On the computational complexity and geometry of the first-order theory of the reals, parts i,ii, iii. J. of Symbolic Computation, pp. 255-352, 1992.
26. J. Stoer and R. Bulirsch. Introduction to Numerical Analysis. Springer, 1993.
27. Y. Sakakibara, M. Brown, R Hughey, I.S. Mian, K. Sjolander, R. Underwood, and D. Haussler. Stochastic context-free grammars for tRNA modeling. Nucleic Acids Research, 22(23):5112-5120, 1994.
28. B. A. Sevastyanov. The theory of branching processes. Uspehi Mathemat. Nauk, 6:47-99, 1951. (In Russian).
29. P. Tiwari. A problem that is easier to solve on the unit-cost algebraic ram. Journal of Complexity, pages 393-397, 1992.