Lab for Automated Reasoning and Analysis LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

test_latex [2016/07/14 15:07]
wikiadmin
test_latex [2019/02/08 11:07] (current)
wikiadmin
Line 3: Line 3:
 <​latex>​ <​latex>​
 \begin{array}{l} \begin{array}{l}
-> 2 \wedge res \geq 0 \wedge (n = n0 \lor res > 14) \rightarrow \\+> 2 \wedge res \geq 0 \wedge (n = n0 \lor res > 14) \rightarrow \\
 2a \land res + 2a >= 0 \wedge (n - 1 = n_0 \lor res + 3a \geq 0) 2a \land res + 2a >= 0 \wedge (n - 1 = n_0 \lor res + 3a \geq 0)
 \end{array} \end{array}
 </​latex>​ </​latex>​
 +
 +fabien
 +
 +We define concatenation and iteration of languages by
 +\begin{eqnarray*}
 +  K_1 \cdot L_2  &=& \{ s_1 \cdot s_2 \mid s_1 \in L_1 \land s_2 \in L_2 \} \\
 +  L^0 &=& \{ \epsilon \} \\
 +  L^{n+1} &=& L \cdot L^n \\
 +  L^* &=& \bigcup_{n \geq 0} L^n = \{ w_1 \ldots w_n \mid w_1,​\ldots,​w_n \in L \}
 +\end{eqnarray*}
 +
 +
 +again 
 +
 +$ a * w + b = c $
 +
  
  
 End End
 
test_latex.1468501632.txt.gz · Last modified: 2016/07/14 15:07 by wikiadmin
 
© EPFL 2018 - Legal notice