5 Representing distributions over strings with automata and grammars T

First Page		Document Content
Date: 2010-07-20 08:11:02 Computer science Applied mathematics Nondeterministic finite automaton Markov chain Probabilistic automaton Deterministic finite automaton Finite-state machine Automata theory Models of computation Theoretical computer science		5 Representing distributions over strings with automata and grammars T Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Download Document from Source Website File Size: 774,44 KB Share Document on Facebook

	Designing Robust Software Systems through Parametric Markov Chain Synthesis ˇ ska† , Simos Gerasimou∗ , Marta Kwiatkowska‡ and Nicola Paoletti§ Radu Calinescu∗ , Milan Ceˇ ∗ Department of Computer Science, U DocID: 1xTt6 - View Document
	Monte Carlo Markov Chain Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point Processes Nima Anari ∗ DocID: 1vbSk - View Document
	Mean field and fluid approaches to Markov chain analysis Jeremy T. Bradley ∗ Department of Computing, Imperial College London, UK Representing the explicit state space of performance models has inheren DocID: 1v7u1 - View Document
	ODE approximations to some Markov chain models Perla Sousi January 13, 2009 DocID: 1uW7y - View Document
	Compiling Markov Chain Monte Carlo Algorithms for Probabilistic Modeling Daniel Huang Jean-Baptiste Tristan DocID: 1uvqp - View Document