[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

View post   
File: 96 KB, 2600x1115, SSARN6Proba.png [View same] [iqdb] [saucenao] [google]
6396345 No.6396345[DELETED]  [Reply] [Original]

I just had the idea that if you have the production rules of a context-free grammar, e.g. 5 possibilities for the replacement of a character, say, then you could assign a probability for each of them and just run a simulation of word generations after n steps, where the number of words just branches and you compute the probability for each path. what is that idea called, does it have some applications?

>> No.6396353

markov chain?

weighted context tree?

>> No.6396465

>>6396353
http://en.wikipedia.org/wiki/Stochastic_context-free_grammar
interesting, thx

>> No.6397900

I have another question:
The standard random walk starts at one point and then the non-zero probabilities for finding the walker after n times spreads with n.
Is there some way to design a stochastic process (boundaries on the steps, I guess), such that after some fixed time n=n0, the probability to find "the moving object" at a certain point?

>> No.6397912

>>6396465
enjoy your independence assumptions, faggot