User Vijay D

491 votes

Accepted

Core algorithms deployed

answered Nov 13, 2013 at 0:33

352 votes

Accepted

What is the enlightenment I'm supposed to attain after studying finite automata?

fl.formal-languages automata-theory big-picture teaching dfa

answered Dec 23, 2012 at 10:37

33 votes

How practical is Automata Theory?

soft-question fl.formal-languages automata-theory teaching

answered Oct 11, 2011 at 4:41

31 votes

Applications of topology to computer science

reference-request ho.history-overview topology survey

answered Apr 7, 2011 at 22:24

30 votes

Most memorable CS paper titles

soft-question big-list

answered Oct 22, 2014 at 22:12

22 votes

A topological space related to SAT: is it compact?

reference-request lo.logic sat topology lattice

answered Sep 5, 2011 at 20:41

22 votes

Beautiful results in TCS

soft-question big-list

answered Feb 27, 2012 at 10:09

21 votes

What is theoretical computer science?

big-picture

answered Nov 4, 2013 at 22:09

19 votes

Why can machine learning not recognize prime numbers?

co.combinatorics machine-learning primes

answered Jan 11, 2013 at 23:40

18 votes

Starting SAT solver papers

ds.algorithms reference-request lo.logic sat

answered Aug 4, 2011 at 1:51

18 votes

Accepted

Do past time LTL and future time LTL have the same expressiveness?

lo.logic temporal-logic linear-temporal-logic

answered Feb 11, 2015 at 18:45

17 votes

Accepted

What is the goal behind abstract interpretation in programming languages?

pl.programming-languages program-analysis

answered Oct 27, 2013 at 7:20

16 votes

Accepted

What algorithms exist for construction a DFA that recognizes the language described by a given regex?

automata-theory regular-expressions dfa

answered Jan 3, 2013 at 8:21

16 votes

Accepted

How can I use my computational theory and analysis powers for the greater good?

soft-question big-picture career

answered Mar 25, 2013 at 2:59

15 votes

Pointers for CS applications of logic

lo.logic soft-question big-list books formal-methods

answered Jan 13, 2013 at 23:06

14 votes

Accepted

Enumerate all solutions of a SAT problem

lo.logic sat software

answered Jul 3, 2013 at 17:46

14 votes

Accepted

Is there a hidden link between the existence uncountable sets and the undecidability of the halting problem?

halting-problem

answered Aug 7, 2013 at 19:21

13 votes

Casual tours around proofs

soft-question big-list

answered Nov 9, 2011 at 16:06

13 votes

Uses of algebraic structures in theoretical computer science

reference-request big-picture big-list algebra survey

answered Apr 2, 2012 at 1:55

12 votes

Regular languages from category-theoretical point of view

fl.formal-languages regular-language ct.category-theory

answered May 10, 2012 at 7:55

12 votes

Accepted

Automated theorem proving via unsupervised approaches

reference-request lo.logic proof-complexity automated-theorem-proving

answered Jun 27, 2012 at 19:18

11 votes

Alan Turing's Contributions to Computer Science

soft-question ho.history-overview

answered Jun 26, 2012 at 21:35

11 votes

Beautiful results in TCS

soft-question big-list

answered Feb 28, 2012 at 7:13

11 votes

To what extent can an algorithm predict the time complexity an arbitrary input program?

computability time-complexity formal-methods se.software-engineering

answered Dec 8, 2012 at 10:03

11 votes

Accepted

Practical applications of parity games

lo.logic two-player-games

answered Feb 1, 2015 at 3:31

10 votes

Accepted

What's the correlation between treewidth and instance hardness for random 3-SAT?

graph-algorithms sat treewidth random-k-sat hard-instances

answered Aug 10, 2013 at 2:39

10 votes

Good reference about approximate methods for solving logic problems

lo.logic approximation-algorithms undecidability

answered Aug 22, 2013 at 20:04

10 votes

Can Hoare logic be used when objects are created or deleted?

program-verification

answered Dec 25, 2012 at 3:12

10 votes

Proofs found by computer

soft-question big-list proofs automated-theorem-proving

answered Jan 14, 2013 at 7:08

10 votes

(N)DFA with same initial/accepting state(s)

fl.formal-languages automata-theory algebra regular-language

answered Jul 7, 2013 at 0:56

Stack Exchange Network

current community

your communities

more stack exchange communities

82 Answers

Core algorithms deployed

What is the enlightenment I'm supposed to attain after studying finite automata?

How practical is Automata Theory?

Applications of topology to computer science

Most memorable CS paper titles

A topological space related to SAT: is it compact?

Beautiful results in TCS

What is theoretical computer science?

Why can machine learning not recognize prime numbers?

Starting SAT solver papers

Do past time LTL and future time LTL have the same expressiveness?

What is the goal behind abstract interpretation in programming languages?

What algorithms exist for construction a DFA that recognizes the language described by a given regex?

How can I use my computational theory and analysis powers for the greater good?

Pointers for CS applications of logic

Enumerate all solutions of a SAT problem

Is there a hidden link between the existence uncountable sets and the undecidability of the halting problem?

Casual tours around proofs

Uses of algebraic structures in theoretical computer science

Regular languages from category-theoretical point of view

Automated theorem proving via unsupervised approaches

Alan Turing's Contributions to Computer Science

Beautiful results in TCS

To what extent can an algorithm predict the time complexity an arbitrary input program?

Practical applications of parity games

What's the correlation between treewidth and instance hardness for random 3-SAT?

Good reference about approximate methods for solving logic problems

Can Hoare logic be used when objects are created or deleted?

Proofs found by computer

(N)DFA with same initial/accepting state(s)