Recent questions tagged peter-linz

0 votes
1 answer
571
0 votes
1 answer
572
For each regular expression, give two strings that are in the corresponding language and two strings that are not.1. (a + b)∗ab(a + b)∗2. b∗ab∗ab∗3. a + (a∗b)...
1 votes
1 answer
577
3 votes
2 answers
585
A. [(00(0+1)* 11] + [11( 0 + 1)* 00]B. [(00+11) (0+1)+] + [( 0 + 1)+ (00+11)].C. [(00+11) (0+1)*] + [( 0 + 1)* (00+11)]D. (00+11) (0+1)* (00+11).