Top network posts

• 47 How old is too old for a PhD?
• 46 Church-Turing Thesis and computational power of neural networks
• 44 Is a push-down automaton with two stacks equivalent to a turing machine?
• 28 How to show that a "reversed" regular language is regular
• 26 If P = NP, why wouldn't $\emptyset$ and $\Sigma^*$ be NP-complete?
• 26 Union of regular languages that is not regular
• 22 Difference between regular expression and grammar in automata
• View more network posts →