**Write the Regular expression for the language of all consecutive even length a’s?**

**Accepted Strings:**Â

These all strings are the part of the language so should be accepted by regular expression;

**Example strings =** {aa, aab, aabaa, aabbaa, aabbbaa,………}and all other strings that contain consecutive even a’s.

**Rejected Strings:**

These all strings are not part of the language so should be rejectedÂ by regular expression;

**Example strings =Â **{a, b, ab, ba, aba, bba, abba,……………..} and all other strings thatÂ do not contain consecutive even a’s in strings.

**R.E =** Â (aa+b)^{*}

Part 1 |
Part 2 |

(aa)* | b* |

## DFA for the language of all consecutive even length a’s

## More Examples of Regular ExpressionÂ

- Regular Expression for no 0 or many triples of 0â€™s and many 1 in the strings.
- RegExp for strings of one or many 11 or no 11.
- A regular expression for ending with abb
- A regular expression for all strings having 010 or 101.
- Regular expression for Even Length Strings defined over {a,b}
- Regular Expression for strings having at least one double 0 or double 1.
- Regular Expression of starting with 0 and having multiple even 1â€™s or no 1.
- Regular Expression for an odd number of 0â€™s or an odd number of 1’s in the strings.
- Regular Expression for having strings of multiple double 1â€™s or null.
- Regular Expression (RE) for starting with 0 and ending with 1.
- RE for ending with b and having zero or multiple sets of aa and bb.
- A regular expression of the second last symbol is 1.
- RE for starting with 1 having zero or multiple even 1â€™s.
- Regular Expression for multiple aâ€™s and multiple bâ€™s.
- RE for exactly single 1 many 0â€™s |exactly single a many b.
- A regular expression for strings starting with aa and ending with ba.
- A regular expression for the language of all consecutive even length a’s.
- A regular expression for the language of all odd-length strings
- A regular expression for the language of all even length strings but ends with aa.
- A regular expression for the language of an odd number of 1s.
- A regular expression for the language of even length strings starting with a and ending with b in theory of automata.
- A regular expression for the language of all even length strings but starts with a.
- A Regular Expression for the Language of all strings with an even number of 0â€™s or even number of 1’s.
- A regular expression for the language of all those strings end with abb.
- A regular expression for string having must 010 or 101.
- Regular expression of Â strings begin with 110

Regular expression of Â strings begin and end with 110

Regular expression of strings containing exactly three consecutive 1â€™s. - A Regular Expression of all strings divisible by 4.
- A Regular Expression Strings that does not contain substring 110.

## Tutorial: Regular Expression

A detailed tutorial of the regular expression is here in the link of regular expression tutorial. This page contains the practice questions of regular expressions with solutions.

**Tutorial covering the topics**

- Give a regular expression.
- Describe the strings of the regular expression.
- write a regular expression.
- create all strings from regular expression.
- Generate all strings from regular expression.
- Extract all strings from regular expression.
- Find all strings from regular expression.
- Examples of regular expression.