Let 𝐿1 be the language represented by the regular expression π‘βˆ—π‘Žπ‘βˆ—β€¦

PYQ GATE 2024

Let 𝐿1 be the language represented by the regular expression π‘βˆ—π‘Žπ‘βˆ— (π‘Žπ‘βˆ—π‘Žπ‘βˆ—)βˆ— and 𝐿2 = { 𝑀 ∈ (π‘Ž + 𝑏)βˆ— | |𝑀| ≀ 4}, where |𝑀| denotes the length of string 𝑀. The number of strings in 𝐿2 which are also in 𝐿1 is ___________

Attempted by 141 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…