Let Ξ£ = {π‘Ž, 𝑏, 𝑐}. For π‘₯ ∈ Ξ£βˆ— , and 𝛼 ∈ Ξ£, let #𝛼(π‘₯) denote the number…

PYQ GATE 2025

Let Ξ£ = {π‘Ž, 𝑏, 𝑐}. For π‘₯ ∈ Ξ£βˆ— , and 𝛼 ∈ Ξ£, let #𝛼(π‘₯) denote the number of occurrences of 𝛼 in π‘₯. Which one or more of the following option(s) define(s) regular language(s)?

  1. A.

    {π‘Žπ‘šπ‘π‘› | π‘š, 𝑛 β‰₯ 0}

  2. B.

    {π‘Ž, 𝑏}βˆ— ∩ {π‘Žπ‘šπ‘π‘› π‘π‘šβˆ’π‘› | π‘š β‰₯ 𝑛 β‰₯ 0}

  3. C.

    {𝑀 | 𝑀 ∈ {π‘Ž, 𝑏}βˆ— , #π‘Ž (𝑀) ≑ 2 (mod 7), and #𝑏 (𝑀) ≑ 3 (mod 9)}

  4. D.

    {𝑀 | 𝑀 ∈ {π‘Ž, 𝑏}βˆ— , #π‘Ž (𝑀) ≑ 2 (mod 7), and #π‘Ž (𝑀) = #𝑏(𝑀)}

Attempted by 137 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…