Computer Science

Popular Question

 Popular Question
Question with 1,000 views. This badge can be awarded multiple times.

earned this badge 21 times.
More than one NFA accepting a given language
Awarded Jan 12, 2022 at 11:41
Why it is said that LBA is a non deterministic Turing Machine
Awarded Dec 6, 2020 at 7:25
Decision problem and algorithm
Awarded Nov 18, 2019 at 4:25
Pumping lemma for CFG doubt
Awarded Oct 20, 2019 at 22:20
How a program is copied to RAM from harddisk
Awarded Feb 6, 2019 at 6:25
Why Deterministic PDA accepts $\epsilon$ input but DFA not
Awarded May 8, 2018 at 16:30
Induction proof, base case not working but induction step works? [closed]
Awarded Feb 12, 2018 at 21:55
Cantor's diagonal method in simple terms?
Awarded Oct 4, 2017 at 19:27
CFG to CNF conversion steps
Awarded Apr 27, 2017 at 6:42
Equivalence of NFA and DFA - proof by construction
Awarded Apr 8, 2017 at 7:30
Importance of recursion in computability theory
Awarded Jan 4, 2017 at 9:07
Language acceptance by DFA
Awarded Feb 4, 2016 at 6:19
Why is the halting problem decidable for LBA?
Awarded Nov 9, 2015 at 10:57
Lower bound for finding kth smallest element using adversary arguments
Awarded Oct 28, 2015 at 5:57
Gödelization in Turing Machine
Awarded Apr 21, 2015 at 15:47
How to use adversary arguments for selection and insertion sort?
Awarded Dec 22, 2014 at 17:49
What is meant by "solvable by non deterministic algorithm in polynomial time" [duplicate]
Awarded Aug 30, 2014 at 15:32
The importance of normal forms like Chomsky normal form for CFGs
Awarded Jun 6, 2014 at 5:43
How to show that a function is not computable? How to show a language is not computably enumerable?
Awarded Apr 25, 2014 at 3:54
Practical application of Finite State Machines
Awarded Apr 1, 2014 at 18:30
DFA to regular expression conversion
Awarded Jan 8, 2014 at 2:30

Others with this badge