Computer Sciences > GATE 2025 SET-2 > Regular Languages
Let Σ={a,b,c}. For x∈Σ*, and α∈Σ, let #α(x) denote the number of occurrences of a in x.
Which one or more of the following option(s) define(s) regular language(s)?
A
{ambn|m,n≥0}
B
{a,b}*∩{ambncm-n|m≥n≥0}
C
{w|w∈{a,b}*,#a(w)≡2(mod 7),and#b(w)≡3(mod 9)}
D
{w|w∈{a,b}*,#a(w)≡2(mod 7) and #a(w)=#b(w)}

Correct : c

Similar Questions

Let L1, L2 be two regular languages and L3 a language which is not regular. Which of the following statements is/are always TRUE?
#859 MSQ
Let L1, L2 be two regular languages and L3 a language which is not regular. Which of the following statements is/are always TRUE?
#859 MSQ
Let L1, L2 be two regular languages and L3 a language which is not regular. Which of the following statements is/are always TRUE?
#859 MSQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......
Question Options

Contributed by: