Skip to main content
Computer Science

Return to Question

Post Closed as "Duplicate" by Yuval Filmus, D.W.♦
deleted 1 character in body; edited title
Source Link
Yuval Filmus
Yuval Filmus
  • 279.1k
  • 27
  • 316
  • 512

What will be the regular expression or the following Regular expressions for some languages?

  1. L={0,1} where allSet of strings areover $\{0,1\}$ having at least two occurrence of the substring 00 and this one.
  2. L= {a^n b^m, n ≥ 4, m ≥ 3}$\{a^n b^m : n ≥ 4, m ≥ 3\}$.
  3. Set of stringstrings over the alphabet {a,b,c}$\{a,b,c\}$ containing at least one a$a$ and one b$b$.

What will be the regular expression or the following languages?

  1. L={0,1} where all strings are having at least two occurrence of the substring 00 and this one
  2. L= {a^n b^m, n ≥ 4, m ≥ 3}
  3. Set of string over the alphabet {a,b,c} containing at least one a and one b

Regular expressions for some languages

  1. Set of strings over $\{0,1\}$ having at least two occurrence of the substring 00.
  2. $\{a^n b^m : n ≥ 4, m ≥ 3\}$.
  3. Set of strings over the alphabet $\{a,b,c\}$ containing at least one $a$ and one $b$.
Source Link
ajax007
ajax007
  • 1
  • 1

What will be the regular expression or the following languages?

  1. L={0,1} where all strings are having at least two occurrence of the substring 00 and this one
  2. L= {a^n b^m, n ≥ 4, m ≥ 3}
  3. Set of string over the alphabet {a,b,c} containing at least one a and one b