StackOverflow Questions for Tag: computer-science-theory
Mr.Sh4nnon
Reputation: 337
Turing machine with one state that converts binary to decimal
Score: 1
Views: 2145
Answers: 1
Chyle Andrei Lee
Reputation: 31
How to find the ith number that has n factors, considering that n isn't prime?
Score: 2
Views: 54
Answers: 0
ฺBUGS
Reputation: 1
How to covert bnf to ebnf from that !? bnf <Z> ::= DCd | D<N>C
Score: 0
Views: 61
Answers: 0
TheEnvironmentalist
Reputation: 2862
Subtle nuances of Big O notation for computation complexity
Score: 2
Views: 135
Answers: 1
BritJam
Reputation: 29
Any tips on understanding Stable matching and unstable pairs
Score: 0
Views: 943
Answers: 1
Mir Nazim
Reputation: 626
Online resources for Introduction to computer and computer sciences for absolute beginner
Score: 2
Views: 389
Answers: 5
Hans von Olo
Reputation: 21
Determining whether a nondeterministic finite automaton accepts every possible string
Score: 2
Views: 888
Answers: 1
Shiladitya Mukherjee
Reputation: 65
Proof of Correctness of Codeforces Problem: Fox and Box Accumulation (388A)
Score: 0
Views: 425
Answers: 0
Eduardo de Quadros
Reputation: 51
Do Spatial Graphs (3-Dimensional Graphs) Exist?
Score: 1
Views: 86
Answers: 1
handora
Reputation: 659
Why most of the distributed computing abstraction is built on fail-stop abstraction?
Score: 0
Views: 81
Answers: 0
patrick_corrigan
Reputation: 899
Can this be parsed by regular expression
Score: 0
Views: 25
Answers: 0
Mohammad Zaheer
Reputation: 1
Generating grammar which contains all the alphabets
Score: 0
Views: 50
Answers: 1
Nyein Chan
Reputation: 1215
How can Turing machine compare to a computer?
Score: 0
Views: 2166
Answers: 0
sorooshi
Reputation: 29
Regularity of a language With pumping Lemma
Score: 1
Views: 117
Answers: 1
Hannah Holloway
Reputation: 1
Proof by induction that every non-empty tree of height h contains fewer than 2^n+1 nodes
Score: 0
Views: 776
Answers: 1
T.Torline
Reputation: 23
Make Greedy Algorithm Fail on Subset of Euro Coins
Score: 1
Views: 596
Answers: 1