Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | |||
regular_expressions_for_automata_with_parallel_inputs [2009/04/28 20:26] vkuncak |
regular_expressions_for_automata_with_parallel_inputs [2009/04/28 20:27] vkuncak |
||
---|---|---|---|
Line 15: | Line 15: | ||
* automata | * automata | ||
on such alphabets. | on such alphabets. | ||
+ | |||
====== Using Propositional Formulas to Denote Finite Sets of Symbols ====== | ====== Using Propositional Formulas to Denote Finite Sets of Symbols ====== | ||
Line 109: | Line 110: | ||
where $p(v_1,\ldots,v_n)$ is a propositional formula and $(a_{i1},\ldots,a_{in})$ for $1 \leq i \leq k$ are all tuples of values of propositional variables for which $p(v_1,\ldots,v_n)$ is true. | where $p(v_1,\ldots,v_n)$ is a propositional formula and $(a_{i1},\ldots,a_{in})$ for $1 \leq i \leq k$ are all tuples of values of propositional variables for which $p(v_1,\ldots,v_n)$ is true. | ||
- | Notational advantage: the set of variables can be larger, the expression is still the same. | + | Notational advantage: even if we increase the number of components by adding new variables, the expression remains the same. |