Theoretical Computer Science
Shaull's user avatar
Shaull's user avatar
Shaull's user avatar
Shaull
  • Member for 12 years
  • Last seen this week
Profile Activity
Stats
5,531
reputation
75k
reached
64
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
21
silver badges
32
bronze badges
Top tags
View all tags
142
Score
28
Posts
32
Posts %
89
Score
14
Posts
16
Posts %
88
Score
15
Posts
17
Posts %
46
Score
10
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
Score Newest
answer
27
Hardest known natural problem in P?
Jan 9, 2014
answer
18
A simple decision problem whose decidability is not known
Sep 4, 2013
answer
17
How small can a NFA be, compared to the minimal Unambiguous Finite Automaton (UFA) of the same regular language?
Jan 12, 2014
question
16
Teaching high school TCS - existing programs
Nov 8, 2013
question
13
When does randomization stops helping within PSPACE
Apr 30, 2015
question
13
Complexity of NFA to DFA minimization with binary threshold
Oct 17, 2021
answer
13
Determinising unambiguous automata without exponential blowup
Sep 19, 2021
question
12
Arithmetic circuits with $\min$, $\max$, and average over $[0,1]$
Feb 11, 2013
answer
12
Minimizing Automata accepting $\omega$-words (i.e. infinite words)
Dec 26, 2014
question
11
Randomized algorithms not based on Schwartz-Zippel
Jan 3, 2022
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?
34
What's an example of an unsatisfiable 3-CNF formula?
32
Is Dijkstra's algorithm just BFS with a priority queue?
24
Regular languages that seem irregular

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.