1,128 views

1 Answer

Best answer
10 votes
10 votes
$\phi = \{\}$, which is empty set. Now by definition of *, it repeats the content of a set ZERO or more times. And anything repeated zero time is $\epsilon$. And nothing repeated 1 or more times is nothing.

So, $\phi^*$ generates  the language $\{\epsilon\}$ whose regular expression is $\epsilon$. Hence,
$$\phi^* = \epsilon$$

It can be also shown as:

$a^* \text{ generates } \{\epsilon, a, aa, aaa, ....\}$
$\phi^* \text{ generates } \{\epsilon\}$
selected by

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
0 answers
2
admin asked Oct 15, 2019
500 views
Consider the problem of determining whether a DFA and a regular expression are equivalent. Express this problem as a language and show that it is decidable.
2 votes
2 votes
0 answers
3
0 votes
0 votes
0 answers
4
admin asked Apr 11, 2019
174 views
Complete the proof of theorem $7.27$ by showing that$(q_{P},w,Z_{0})\vdash(q,\in,\gamma)$ if and only if $(q_{P},q_{A},w,Z_{0}) \vdash((q,p),\in,\gamma),$ where $p =\hat...