I was trying to figure out the value of the following expression.(0 | 1)*00  (0 | 1)*01I tried drawing DFAs for(0 | 1)*00 and (0 | 1)*01 separately and combine them using a table. Is it the approach I should use? or is there any better way?
How to get the intersection of two regular languages?
regular languages;finite automata;regular expressions
One simple way is to note that $(0 | 1)*00$ is a set of strings thatall end with the symbol $0$, while $(0 | 1)^*01$ is a set of strings thatall end with the symbol $1$.Hence, no string can be in both sets, which implies that theirintersection is empty: $$(0 | 1)*00\cap(0 | 1)^*01=\emptyset$$