Computer Science
user avatar
user avatar
user avatar
Shaull
  • Member for 9 years, 4 months
  • Last seen this week
Profile Activity
Stats
16,196
reputation
602k
reached
286
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
30
silver badges
58
bronze badges
Top tags
View all tags
249
Score
50
Posts
17
Posts %
224
Score
51
Posts
18
Posts %
195
Score
32
Posts
11
Posts %
170
Score
31
Posts
11
Posts %
160
Score
41
Posts
14
Posts %
152
Score
28
Posts
10
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
31
What's an example of an unsatisfiable 3-CNF formula?
Jan 30, 2014
answer
30
Is Dijkstra's algorithm just BFS with a priority queue?
Feb 24, 2013
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
Finite state automata: final states
Jun 4, 2018
answer
17
Is it decidable whether a given context free grammar generates an infinite number of strings?
Jan 31, 2016
answer
16
How do you classify properties as Trivial and Non-trivial?
Feb 27, 2014
answer
15
Is there an efficient test for if an NFA accepts a subset of another NFA?
Feb 20, 2013
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.