Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
sav08:using_automata_to_decide_ws1s [2011/04/12 15:09] vkuncak |
sav08:using_automata_to_decide_ws1s [2012/05/15 12:48] vkuncak |
||
---|---|---|---|
Line 14: | Line 14: | ||
\] | \] | ||
- | Instead of $e(F)(D,\alpha(w))={\it true}$ we write for short $w \models F$. | + | Instead of $e(F)(D,\alpha(w))={\it true}$ we write for short $w \models F$. So, we design automata so that: |
+ | \[ | ||
+ | w \in L(A(F)) \ \ \ \iff \ \ \ w \models F | ||
+ | \] | ||
The following lemma follows from the definition of semantic evaluation function 'e' and the shorthand $w \models F$. | The following lemma follows from the definition of semantic evaluation function 'e' and the shorthand $w \models F$. | ||
**Lemma**: Let $F,F_i$ denote formulas, $w \in \Sigma^*$. Then | **Lemma**: Let $F,F_i$ denote formulas, $w \in \Sigma^*$. Then | ||
- | * $w \models (F_1 \lor F_2)$ iff $w \models F_1$ and $w \models F_2$ | + | * $w \models (F_1 \lor F_2)$ iff $w \models F_1$ or $w \models F_2$ |
* $w \models \lnot F$ iff $\lnot (w \models F)$ | * $w \models \lnot F$ iff $\lnot (w \models F)$ | ||
* $w \models \exists x.F$ iff $\exists b. patch(w,x,b) \models F$ | * $w \models \exists x.F$ iff $\exists b. patch(w,x,b) \models F$ |