Prove ‘think i found the proof. Here’s how it goes. We construct a graph out of the given statement. If there are n-symbols, then we have 2n vertices, corresponding to the symbols and thei… more →
Well, that about wraps it up for GodtheCipher wrote 2 weeks ago: Rite of Passage This is exactly how I felt through four years of my undergraduate classes! P. … more →
ZiKaS wrote 2 months ago: Finite Automaton Definition: A finite automaton is a 5-tuple (Q, , δ, q0, F), where: Q is a finite s … more →
ZiKaS wrote 2 months ago: The theory of computation begins with a question: What is a computer? We use computational model to … more →
ZiKaS wrote 2 months ago: Aim of the course: Determine what can and can’t be computed How quickly With how memory On whi … more →
ThanNguyen wrote 2 months ago: Lang thang 1 hồi trên net, đi vòng từ blog này qua blog kia. Thì phát hiện được cái blog cá nhân về … more →
apurvnakade wrote 11 months ago: Prove ‘think i found the proof. Here’s how it goes. We construct a graph out of the give … more →
apurvnakade wrote 11 months ago: Let P(n) denote the number of partitions of n then If you do not get the notation, the pair <r,j … more →
apurvnakade wrote 12 months ago: I have to read stuff on markov chains for the next semester. I wonder how something so simple and us … more →
angstrazedarmies wrote 1 year ago: I am so over my life right now. Being a senior in college is slowly killing me from the inside out. … more →
apurvnakade wrote 1 year ago: Prove that the set of strings which are “not” of the form ww is a context-free language. … more →
iisc wrote 1 year ago: bhOndOO wanted a book to understand the basics of Theory of Computation. He went to IISc library, gr … more →