Computer Science
Shaull
  • Member for 8 years, 11 months
  • Last seen this week
Profile Activity
Stats
15,821
reputation
574k
reached
279
answers
2
questions
top 0.65% overall
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
28
silver badges
57
bronze badges
Top tags
View all tags
243
Score
49
Posts
17
Posts %
216
Score
49
Posts
17
Posts %
192
Score
31
Posts
11
Posts %
168
Score
30
Posts
11
Posts %
158
Score
41
Posts
15
Posts %
150
Score
28
Posts
10
Posts %
Top posts
View all questions and answers
All Questions Answers
Votes Newest
39
Can one build a "mechanical" universal Turing machine?
Dec 30 '20
39
Can a language have more than one DFA?
Feb 3 '16
31
What's an example of an unsatisfiable 3-CNF formula?
Jan 30 '14
29
Is Dijkstra's algorithm just BFS with a priority queue?
Feb 24 '13
18
Flaw in my NP = CoNP Proof?
Mar 12 '13
17
Finite state automata: final states
Jun 4 '18
17
Is it decidable whether a given context free grammar generates an infinite number of strings?
Jan 31 '16
16
Construct two functions $f$ and $g$ satisfying $f \ne O(g), g \ne O(f)$
Mar 16 '13
15
How do you classify properties as Trivial and Non-trivial?
Feb 27 '14
15
Is there an efficient test for if an NFA accepts a subset of another NFA?
Feb 20 '13
Top network posts
View all network posts
28
Hardest known natural problem in P?
18
A simple decision problem whose decidability is not known
16
Teaching high school TCS - existing programs
16
How small can a NFA be, compared to the minimal Unambiguous Finite Automaton (UFA) of the same regular language?
13
Complexity of NFA to DFA minimization with binary threshold

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.