# Regular Expression Strings does not contain substring 110

## Regular Expression of all those Strings that do not contain the substring 110.

Regular Expression: (0+10) * 1*

## DFA of all those Strings that do not contain the substring 110

Accepted Strings (part of the language)

• The strings of length 1 = {1, 0, no more string exist}
• The strings of length 2 = {11, 10, ,….and many more similar strings.}
• The strings of length 3 = {011, 101,….and many more similar strings.}
• The strings of length 4 = {1111, 1011, 1010,….and many more similar strings.}
• The strings of length 7 = {1010101, 1010101, 10000001,….and many more similar strings.}
• The strings of length 10 = {1111111111, 0000000000, 10101010101,….and many more similar strings.}
• The strings of length 15 = {101010101010101, 010101010101010, 011011011011011,….and many more similar strings.}
• The strings of length 20= {11111111111111111111, 01010101010101010101, 00000000000000000000,….and many more similar strings.}
• The strings of length 25 = {01111111111111111111111111, 0101010101010101010101010, 0000000000000000000000000,….and many more similar strings.}
• And many more similar strings.

Rejected Strings (not part of the language):

• The strings of length 1 = {no string exist}
• The strings of length 2 = {no string exist}
• The strings of length 3 = {110, no more strings}
• The strings of length 5 = {11110, 00110, 11101,….and many more similar strings.
•  }
• The strings of length 7 = {1101111, 1101110, 1100110,….and many more similar strings.}
• The strings of length 9 = {110111111, 110001110, 110011011,….and many more similar strings.}
• The strings of length 15 = {111101101111111, 110001110110110, 001101100110111,….and many more similar strings.}
• The strings of length 20 = {11110110110110110110, 11011011000111011011, 001101100110111,….and many more similar strings.}
• The strings of length 25 = {1111011011011011011011011, 0011011011011000111011011, 11011001101100110111,….and many more similar strings.}
• And many more similar strings.

## Regular Expression Strings does not contain substring bba

Regular Expression: (a+ba) * b*

Accepted Strings (part of the language)

• The strings of length 1 = {b, a, no more string exist}
• The strings of length 2 = {bb, ba, ,….and many more similar strings.}
• The strings of length 3 = {abb, bab,….and many more similar strings.}
• The strings of length 4 = {bbbb, babb, baba,….and many more similar strings.}
• The strings of length 7 = {bababab, bababab, baaaaaab,….and many more similar strings.}
• The strings of length 10 = {bbbbbbbbbb, aaaaaaaaaa, bababababab,….and many more similar strings.}
• The strings of length 15 = {bababababababab, abababababababa, abbabbabbabbabb,….and many more similar strings.}
• The strings of length 20= {bbbbbbbbbbbbbbbbbbbb, abababababababababab, aaaaaaaaaaaaaaaaaaaa,….and many more similar strings.}
• The strings of length 25 = {abbbbbbbbbbbbbbbbbbbbbbbbb, ababababababababababababa, aaaaaaaaaaaaaaaaaaaaaaaaa,….and many more similar strings.}
• And many more similar strings.

Rejected Strings (not part of the language)

• The strings of length 1 = {no string exist}
• The strings of length 2 = {no string exist}
• The strings of length 3 = {bba, no more strings}
• The strings of length 5 = {bbbba, aabba, bbbab,….and many more similar strings.
• }
• The strings of length 7 = {bbabbbb, bbabbba, bbaabba,….and many more similar strings.}
• The strings of length 9 = {bbabbbbbb, bbaaabbba, bbaabbabb,….and many more similar strings.}
• The strings of length 15 = {bbbbabbabbbbbbb, bbaaabbbabbabba, aabbabbaabbabbb,….and many more similar strings.}
• The strings of length 20 = {bbbbabbabbabbabbabba, bbabbabbaaabbbabbabb, aabbabbaabbabbb,….and many more similar strings.}
• The strings of length 25 = {bbbbabbabbabbabbabbabbabb, aabbabbabbabbaaabbbabbabb, bbabbaabbabbaabbabbb,….and many more similar strings.}
• And many more similar strings.

## 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.