The non- Kleene Star operation accepts the following string of finite length over set A = {0,1} | where string s contains even number of 0 and 1
(a) 01,0011,010101
(b) 0011,11001100
(c) ε,0011,11001100
(d) ε,0011,11001100
This question was posed to me in an international level competition.
I'm obligated to ask this question of Finite Automata-Introduction in section Finite Automata of Automata Theory