LARA

Differences

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

Link to this comparison view

Both sides previous revision Previous revision
sav08:homework12 [2008/05/15 10:23]
vkuncak
sav08:homework12 [2008/05/15 10:24]
vkuncak
Line 4: Line 4:
  
 Write a regular expression in alphabet $\{x,y,z\} \to \{0,1\}$ denoting relation $z = x + y$ using [[:Regular expressions for automata with parallel inputs]]. ​ Try to make your regular expression as concise and understandable as possible. Write a regular expression in alphabet $\{x,y,z\} \to \{0,1\}$ denoting relation $z = x + y$ using [[:Regular expressions for automata with parallel inputs]]. ​ Try to make your regular expression as concise and understandable as possible.
 +
  
 ===== Problem 2 ===== ===== Problem 2 =====
Line 15: Line 16:
    r^p_F = \{ (p,q) \mid G(p,q) \}    r^p_F = \{ (p,q) \mid G(p,q) \}
 \] \]
-where $G$ is a Presburger arithmetic formula. ​ Are the set of all $r^s_F$ and set of all $r^p_F$ equal, is one strict subset, or are they incomparable?​+where $G$ is a Presburger arithmetic formula. ​ Are the set of all $r^s_F$ and set of all $r^p_F$ equal, is one strict subset ​of the other, or are they incomparable?​
  
 ===== Optional Problem 3 ===== ===== Optional Problem 3 =====