GATE CS 2021,Set-2,Q9:Let L ⊆{0,1}* be an arbitrary regular language accepted by a minimal DFA with
GATE CS 2021,Set-2,Q9:Let L ⊆{0,1}* be an arbitrary regular language accepted by a minimal DFA with k states . Which one of the following languages must necessarily be accepted by a minimal DFA with k states?
(A) L-{01}
(B)L∪{01}
(C){0,1}*-L
(D)L.L
Ans : (C){0,1}*-L
---------------------------------------------------
Subscribe my channel for more updates / monalisacs
----------------------------------------------------------
Join Telegram GATE CS study group: https://t.me/MonalisaCS
---------------------------------------------------------------
Compiler Design Lectures : • Ch 1.1:Language Processing System |CD...
----------------------------------------------------------------
Compiler Design PYQ : • Ch 1.1:Language Processing System |CD...
----------------------------------------------------------------------
Theory Of Computation Lectures • Video
-------------------------------------------------------------------
TOC GATE PYQ: • GATE CS 2010,Q39:Let L={w ∈ (0 + 1)* ...
-------------------------------------------------------------------
Data Structure Lecture: • Data Structure Syllabus for GATE
---------------------------------------------------------------------
Data Structure PYQ: • Data Structure Syllabus for GATE
-----------------------------------------------------------------------
#GATE2021#GATECSE#TOC_PYQ