what would be regular expression to say : A deterministic automaton that is: $\Sigma = \{a, b\}$ that accepts strings of length at least $2$ consisting of either: all $a$’s or all $b$’s (but not containing both symbols). I am looking for answer in following form such as $a^*b^+c||c$ . This is just an indication. I have an idea if, $(aa^+\mid bb^+)$ is right expression...
Asked
Active
Viewed 216 times
1
-
singular it's automaton – adjan Oct 12 '16 at 11:33
-
1Yes, $aa^+\mid bb^+$ will work. – Brian M. Scott Oct 13 '16 at 02:51
-
thanks for reply, that was right answer – surendrapanday Jun 04 '18 at 09:55