The regular expression denote a language comprising all possible strings of even length over the alphabet (0,1) is?
Posted: Thu Jul 14, 2022 9:07 am
a) 1 + 0(1+0)*
b) (0+1)(1+0)*
c) (1+0)
d) (00+0111+10)*
b) (0+1)(1+0)*
c) (1+0)
d) (00+0111+10)*