www-ai.cs.tu-dortmund.de/PublicPublicationFiles/rieger_95d.pdf
ls8-report-18.dvi
#CC(i)
#SC(i)
SC(i)
CC(i)
Node i
Root
2
Node i Node i Node i
#CC(i )
#SC(i )
CC(i )
SC(i )
#CC(i )
#SC(i )
CC(i )
#CC(i )
CC(i )
SC(i )
#SC(i )
1
1
1
1
1 2 3
2
2
2
2
3
3
3
3
......
SC(i )
bf (.....) bf ( [...] Sensor1,TS,TE,parallel) &
s_jump(Trace,Sensor2,TS,TE,parallel) &
adjacent(Sensor1,Sensor2) &
sclass(Trace,Sensor1,T1,T2,right) &
sclass(Trace,Sensor2,T1,T2,right) &
T1 < TS & End < TE.
This rule states [...] course, remain deterministic. In the second step, we have to
q iq i
q j q
j1 q
j 2 q
j 3
bfbf
bf1 bf2 bf3
c1,c2,c3
bfbf
c1 c2 c3
Figure 6: DFA ! NFA
estimate the transition probabilities for the non-deterministic …
