user avatar
user avatar
user avatar
Kishan Kumar
  • Member for 4 years, 9 months
  • Last seen more than a month ago
  • NIT Srinagar
12 votes
2 answers
9k views

Do system calls always means a context switch?

4 votes
2 answers
873 views

Given a language L what can we say about the decidability of whether this language is regular or not?

4 votes
1 answer
391 views

What is the difference between Boolean Algebra and Boolean Lattice?

2 votes
0 answers
705 views

Is the complement of $L = \{a^nb^mc^p \, n= m= p\}$ context free language?

2 votes
1 answer
434 views

Are linear languages always unambiguous?

2 votes
2 answers
749 views

Does rice theorem applies to languages only or does it apply to machines as well?

2 votes
1 answer
354 views

What is the relation between countability and recursive enumeration? [duplicate]

2 votes
2 answers
6k views

Is this language context free L=${a^mb^nc^pd^q: m+n=p+q}$?

2 votes
4 answers
6k views

Why does a Turing Machine need at least two states?

2 votes
1 answer
382 views

Is a computer equivalent to a Turing machine or linear bounded automata?

1 vote
1 answer
425 views

Why do we use RSA if it is not secure against chosen ciphertext attack?

1 vote
3 answers
1k views

Solving $T(n)=4T(n/4) +(n/\log n)^2$

1 vote
1 answer
445 views

What are some undecidable problems for recursive languages?

1 vote
1 answer
679 views

Is the problem of deciding whether a Context free grammar generates exactly K strings is decidable?

1 vote
0 answers
1k views

Does $\log(f(n)) = O(\log(g(n)))$ imply $f(n)=O(g(n))$? [closed]

1 vote
1 answer
282 views

Why do we need binary trees when we have multi branch trees? [closed]

1 vote
1 answer
84 views

Is there any language for which $\overline{L^*}=\big(\overline L\big)^*$?

1 vote
2 answers
213 views

What is the difference between language hierarchy and Grammar hierarchy for LL and LR?

1 vote
1 answer
3k views

Is the complement of every non Turing recognizable language a Turing recognizable language?

0 votes
1 answer
776 views

If $f(n)=\Omega(g(n))$ and $h(n)=\theta (g(n))$ then does this implies $f(n).g(n)=\Omega(g(n).h(n))$?

0 votes
1 answer
711 views

Is the set of real numbers a language?

0 votes
0 answers
172 views

Why don't we use $ as end marker for input in PDA?

0 votes
1 answer
3k views

Is the balanced parentheses language inherently ambiguous? [duplicate]

0 votes
0 answers
17 views

Let $L_1$ be a DCFL and $L_2$ be recursive language. Is $L_1 \cap L_2$ a DCFL?