- Apr 6, 2002
- 7,141
- 1
- 0
You are given the following alphabet: {a,b,c,d}
Write a regular expression describing the set of all identifiers (i.e., strings) having at most 2 occurrences of the letter c. For example, the identifier "abbcdaac" would belong to this set, but the identifier "aabcdaacc" would not.
Write a regular expression describing the set of all identifiers (i.e., strings) having at most 2 occurrences of the letter c. For example, the identifier "abbcdaac" would belong to this set, but the identifier "aabcdaacc" would not.