Ph.D Student in the Hebrew University, Jerusalem, Israel.
Research interests: Formal Verification, Temporal Logic, Automata theory, Weighted automata and weighted logics, and all things theoretical.
27 Hardest known natural problem in P? jan 9 '14
16 Teaching high school TCS - existing programs nov 8 '13
13 How small can a NFA be, compared to the minimal Unambiguous Finite Automaton (UFA) of the same regular language? jan 12 '14
11 A simple problem whose decidability is not known sep 4 '13