GATE CSE 2021 Set 2 | Question: 9 | Video Solution
in Theory of Computation recategorized by
0 votes
0 votes

Let $L \subseteq \{0,1\}^*$ be an arbitrary regular language accepted by a minimal $\text{DFA}$ with $k$ states. Which one of the following languages must necessarily be accepted by a minimal $\text{DFA}$ with $k$ states?

  1. $L-\{01\}$
  2. $L \cup \{01\}$
  3. $\{0,1\}^* – L$
  4. $L \cdot L$
in Theory of Computation recategorized by
1.4k points

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.