Register

GO Classes CS Test Series | Theory of Computation | Subject Wise Test 3 | Question: 24

• retagged by
99 views
1 1 vote

If a finite number of strings is added to a non-regular language $\mathrm{A}$, then the resulting language $\mathrm{B}$ satisfies which of the following?

  1. $\mathrm{B}$ must be a regular language.
     
  2. $\mathrm{B}$ must be a non-regular language.
     
  3. $\mathrm{B}$ must be a non-context-free language.
     
  4. $\mathrm{B}$ must have a context-free grammar.

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← Previous · GO Classes CS Test S...Next → · GO Classes CS Test S...
← Previous in category · GO Classes CS Test S...Next in category → · GO Classes CS Test S...
Position:
Show:

Related questions

2 2 votes
5 5 answers
420
420 views
GO Classes asked Dec 18, 2025
420 views
GO Classes CS Test Series | Theory of Computation | Subject Wise Test 3 | Question: 17
Consider the following grammar $\text{G}$, where $\text{S}$ is the start symbol:$\mathrm{S} \rightarrow \mathrm{AcB}$$\mathrm{A} \rightarrow \mathrm{cA} \mid \mathrm{aB}$...
2 2 votes
1 1 answer
185
185 views
GO Classes asked Dec 18, 2025
185 views
GO Classes CS Test Series | Theory of Computation | Subject Wise Test 3 | Question: 30
If $A$ and $B$ are finite languages defined over the same alphabet $\Sigma$, then$\bar{A} \circ B$ must be finite. $\bar{A} \circ B$ must be infinite. $A \cap \bar{B}$ mu...
1 1 vote
1 1 answer
112
112 views
GO Classes asked Dec 18, 2025
112 views
GO Classes CS Test Series | Theory of Computation | Subject Wise Test 3 | Question: 16
The language $A=\left\{b^i a^j \mid i \geq 0, j \geq 0\right.$, and $\left.j=2 i\right\}$ satisfies which of the following?$A$ has regular expression $b^*(a a)^*$. $A$ ha...
1 1 vote
1 1 answer
122
122 views
GO Classes asked Dec 18, 2025
122 views
GO Classes CS Test Series | Theory of Computation | Subject Wise Test 3 | Question: 18
Consider the following non-deterministic finite automaton, where $\text{A}$ is the initial state and $\text{D}$ is the only accepting state.Which deterministic finite aut...