Top network posts

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