Computer Science
Profile Activity
Network profile
103
reputation
6

Nabhan Abdulla

Third year B.Tech CSE student at NIT Calicut

6
answers
2
questions
~10k
people reached
  • India
  • Nabhan-pv
  • Member for 2 years, 5 months
  • 17 profile views
  • Last seen Jul 29 '20 at 16:49

Communities (6)

Top network posts

We respect a laser-like focus on one topic.

Top tags (7)

Score 6
Posts 5
Posts % 62
Score 3
Posts 4
Score 3
Posts 2
Score 3
Posts 1
Score 2
Posts 4
Score 0
Posts 2
View all tags →

Top posts (8)

All Questions Answers
Votes Newest
3 Decide whether a DFA accepts the empty language Nov 10 '18
1 Is the language of all TMs accepting all strings starting with 010 decidable? Nov 10 '18
1 Can the complement of a non-recursive language be RE Nov 10 '18
1 Can a Turing machine decide the language $L_\emptyset$ of machines with empty language? Nov 10 '18
1 Why aren't recognizable languages and co-recognizable languages not reducible to each other? Nov 10 '18
0 Can any problem that runs in exponential time on a deterministic RAM be run in polynomial time on a non-deterministic RAM? Nov 10 '18
0 A,B decidable: proof that A\B is decidable too Nov 10 '18
0 The language of TMs accepting some word starting with 101 Nov 10 '18

Badges (6)

Gold

—

Silver

—

Bronze

6

Rarest

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.