GATE CS 2024 | Set 2 | Question: 52 Let 𝐿1 be the language represented by the regular expression 𝑏∗𝑎

Опубликовано: 26 Октябрь 2024
на канале: Monalisa CS

227

GATE CS 2024 | Set 2 | Question: 52
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 ________.

Ans: 15
0:00 Intro & Question
0:40 Solution

----------------------------------------------------
📗👩‍🏫Math Lecture for GATE CS    • Mathematics Lectures for GATE CSE by ...
❓🙋‍♀️Math GATE PYQ :    • Mathematics GATE CSE PYQ (2010-2024) ...
----------------------------------------------
❓🙋‍♀️GATE General Aptitude (GA) solved by Monalisa    • General Aptitude PYQ solved by Monali...
----------------------------------------------------------------
📘👩‍🏫Algorithm Lectures :   • Algorithm Lectures for GATE CSE by Mo...
❓🙋‍♀️Algorithm GATE PYQ:    • Algorithm GATE CSE PYQ (2010-2024) so...
----------------------------------------------------------------
📙👩‍🏫Compiler Design Lectures :   • Compiler Design Lectures for GATE Com...
❓🙋‍♀️Compiler Design PYQ :   • Compiler Design PYQ(2010-2024) GATE C...
----------------------------------------------------------------------
📔👩‍🏫Theory Of Computation Lectures    • TOC (Theory of Computation) Lectures ...
❓🙋‍♀️TOC GATE PYQ:    • TOC (Theory of Computation) GATE CSE ...
-------------------------------------------------------------------
📒👩‍🏫Data Structure Lecture:    • Data Structure Lecture for GATE Compu...
❓🙋‍♀️Data Structure PYQ:    • Data Structure GATE CS PYQ(2010-2024)...
-----------------------------------------------------------------------
#gate_cs #gate #toc #gate2024 #computerscience #theoryofcomputation #automata #regularexpressions