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 | ||
regular_expressions_for_automata_with_parallel_inputs [2009/04/28 20:24] vkuncak |
regular_expressions_for_automata_with_parallel_inputs [2009/04/28 20:26] vkuncak |
||
---|---|---|---|
Line 15: | Line 15: | ||
* automata | * automata | ||
on such alphabets. | on such alphabets. | ||
+ | |||
+ | ====== Using Propositional Formulas to Denote Finite Sets of Symbols ====== | ||
Suppose $\Sigma = \{0,1\}$. | Suppose $\Sigma = \{0,1\}$. | ||
Line 79: | Line 81: | ||
\right) | \right) | ||
\] | \] | ||
- | The bitwise and relation is given by | + | The bitwise **and** relation, shown above, is given by |
\[ | \[ | ||
[z \leftrightarrow (x \land y)]^* | [z \leftrightarrow (x \land y)]^* |