Computer Science
Shaull's user avatar
Shaull's user avatar
Shaull's user avatar
Shaull
  • Member for 10 years, 10 months
  • Last seen this week
Profile Activity
Stats
16,974
reputation
687k
reached
291
answers
2
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
34
silver badges
62
bronze badges
Top tags
View all tags
252
Score
50
Posts
17
Posts %
230
Score
51
Posts
17
Posts %
198
Score
33
Posts
11
Posts %
181
Score
30
Posts
10
Posts %
174
Score
32
Posts
11
Posts %
167
Score
26
Posts
9
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
39
Can a language have more than one DFA?
Feb 3, 2016
answer
39
Can one build a "mechanical" universal Turing machine?
Dec 30, 2020
answer
34
What's an example of an unsatisfiable 3-CNF formula?
Jan 30, 2014
answer
32
Is Dijkstra's algorithm just BFS with a priority queue?
Feb 24, 2013
answer
24
Regular languages that seem irregular
Aug 21, 2022
answer
18
False proofs that look correct
Jun 8
answer
18
Flaw in my NP = CoNP Proof?
Mar 12, 2013
answer
17
Construct two functions $f$ and $g$ satisfying $f \ne O(g), g \ne O(f)$
Mar 16, 2013
answer
17
Is it decidable whether a given context free grammar generates an infinite number of strings?
Jan 31, 2016
answer
17
Finite state automata: final states
Jun 4, 2018
Top network posts
View all network posts
28
Hardest known natural problem in P?
18
A simple decision problem whose decidability is not known
17
How small can a NFA be, compared to the minimal Unambiguous Finite Automaton (UFA) of the same regular language?
16
Teaching high school TCS - existing programs
13
When does randomization stops helping within PSPACE

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.