Theoretical Computer Science
Shaull
  • Member for 10 years, 1 month
  • Last seen this week
Profile Activity
Stats
5,221
reputation
64k
reached
60
answers
24
questions
Communities
View all
About

Assistant Professor at the Technion, Israel.

Research interests: Dynamical Systems, Formal Verification, Temporal Logic, Automata Theory, Weighted Automata and Weighted Logics, and all things theoretical.

Badges
View all badges
1
gold badge
20
silver badges
30
bronze badges
Top tags
View all tags
120
Score
24
Posts
29
Posts %
83
Score
13
Posts
15
Posts %
82
Score
14
Posts
17
Posts %
38
Score
9
Posts
11
Posts %
32
Score
6
Posts
7
Posts %
32
Score
6
Posts
7
Posts %
Top posts
View all questions and answers
All Questions Answers
Votes Newest
28
Hardest known natural problem in P?
Jan 9 '14
18
A simple decision problem whose decidability is not known
Sep 4 '13
16
How small can a NFA be, compared to the minimal Unambiguous Finite Automaton (UFA) of the same regular language?
Jan 12 '14
16
Teaching high school TCS - existing programs
Nov 8 '13
13
Complexity of NFA to DFA minimization with binary threshold
Oct 17 '21
12
Arithmetic circuits with $\min$, $\max$, and average over $[0,1]$
Feb 11 '13
12
When does randomization stops helping within PSPACE
Apr 30 '15
12
Minimizing Automata accepting $\omega$-words (i.e. infinite words)
Dec 26 '14
12
Determinising unambiguous automata without exponential blowup
Sep 19 '21
10
Finite-State Automata over a real-valued alphabet
Feb 4 '21
Top network posts
View all network posts
39
Can one build a "mechanical" universal Turing machine?
39
Can a language have more than one DFA?
31
What's an example of an unsatisfiable 3-CNF formula?
29
Is Dijkstra's algorithm just BFS with a priority queue?
18
Flaw in my NP = CoNP Proof?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.