Computer Science

Nice Answer

 Nice Answer
Answer score of 10 or more. This badge can be awarded multiple times.

earned this badge 7 times.
Why are regular expressions defined with union, concatenation and star operations?
Awarded Jan 31 '20 at 9:05
What parts of a programming language can't be defined using Regular Expressions?
Awarded Mar 11 '19 at 18:50
Why do pushdown automata use a stack?
Awarded Oct 24 '18 at 13:20
on “On the cruelty of really teaching computing science”
Awarded Jun 6 '17 at 10:27
Theoretical machines which are more powerful than Turing machines
Awarded Feb 19 '17 at 20:45
(post deleted or otherwise unavailable)
Awarded Jan 24 '17 at 8:58
Is language equality for linear context-free grammars decidable?
Awarded May 13 '16 at 0:38

Others with this badge