If a language consists of set {a, b, c} only how can we construct a regular expression for the langage in which no two consecutive characters appear.} only ho
If a language consists of set {a, b, c} only how can we construct a regular expression for the langage in which no two consecutive characters appear.} only ho