Theoretical Computer Science

Revival

 Revival
Answer more than 30 days after a question was asked as first answer scoring 2 or more. This badge can be awarded multiple times.

earned this badge 4 times.
Subsets of $\omega$-words which share certain factors and languages accepted by special (prefix-closed) automata
Awarded Jul 9 '20 at 19:35
Are there variants of visibly pushdown automata that allow pushing of words onto the stack?
Awarded Nov 30 '17 at 10:22
Is there a generalization of the GO game that is known to be Turing complete?
Awarded Apr 30 '15 at 16:54
Reducing threshold questions to finiteness questions
Awarded Jul 29 '13 at 6:14

Others with this badge