recategorized by
724 views
1 votes
1 votes

For a language $L$ over the alphabet $\{a, b\}$, let $\overline{L}$ denote the complement of $L$ and let $L^{\ast}$ denote the Kleene-closure of $L$. Consider the following sentences.

  1. $\overline{L}$ and $L^{\ast}$ are both context-free.
  2. $\overline{L}$ is not context-free but $L^{\ast}$ is context-free.
  3. $\overline{L}$ is context-free but $L^{\ast}$ is regular.

Which of the above sentence(s) is/are true if $L=\left \{ a^{n}b^{n} \mid n\geq 0\right \}$?

  1. Both (i) and (iii)
  2. Only (i)
  3. Only (iii)
  4. Only (ii)
  5. None of the above
recategorized by

1 Answer

0 votes
0 votes
Option $(B)$

$\bar{L} = \{a^nb^m|n \neq m ;n,m \geq 0\}$ This is CFL

$L^{*} = (a^nb^n)^*$ will always be CFL as CFL are closed under kleene-closure but it is not regular as it requires $b$ to match with the $a$ before starting with another runs of $a$.
edited by
Answer:

Related questions

539
views
1 answers
2 votes
soujanyareddy13 asked Mar 25, 2021
539 views
Consider the following two languages. ... this question only if we resolve the status of the $\text{NP}$ vs. $\text{P}$ question.
657
views
2 answers
1 votes
soujanyareddy13 asked Mar 25, 2021
657 views
Which of the following regular expressions defines a language that is different from the other choices? ...
715
views
1 answers
2 votes
soujanyareddy13 asked Mar 25, 2021
715 views
Let $L$ be a context-free language generated by the context-free grammar $G = (V, \Sigma, R, S)$ where $V$ is the finite set of variables, $\Sigma$ the finite set of ... ast }${L}'=\left \{ xx \mid x \in L \right \}$None of the above
634
views
1 answers
1 votes
soujanyareddy13 asked Mar 25, 2021
634 views
Let $n, m$ and $k$ be three positive integers such that $n \geq m \geq k$. Let $S$ be a subset of $\left \{ 1, 2,\dots, n \right \}$ of size $k$. Consider sampling a ... 1-\frac{k!\binom{n}{k}}{n^{k}}$1-\frac{k!\binom{n}{k}}{m^{k}}$