Theoretical Computer Science
Michael Wehar's user avatar
Michael Wehar's user avatar
Michael Wehar's user avatar
Michael Wehar
  • Member for 10 years, 9 months
  • Last seen more than a month ago
Profile Activity
Stats
5,127
reputation
472
reached
3
answers
0
questions
Communities
View all
About

  • I am enthusiastic about automata theory.

  • I ran in the 2018 cstheory moderator election and lost by two votes.

  • Here is a short article that I wrote on "What to do if you have a proposed solution to P vs NP?" https://github.com/MichaelWehar/P-vs-NP-Community

Thank you for stopping by and please always feel welcome to contact me! :)

Badges
View all badges
This user doesn’t have any gold badges yet.
10
silver badges
3
bronze badges
Top tags
15
Score
3
Posts
100
Posts %
15
Score
3
Posts
100
Posts %
6
Score
1
Posts
33
Posts %
Top posts
All Questions Answers
Score Newest
answer
6
2018 Potential Moderator Election Community Interest Check
Jun 11, 2018
answer
5
2018 Moderator Election Q&A - Question Collection
Jun 20, 2018
answer
4
2018 Moderator Election Q&A - Questionnaire
Jun 26, 2018
Top network posts
View all network posts
26
Deciding emptiness of intersection of regular languages in subquadratic time
25
Finding the smallest DFA that separates two words without using brute force search?
24
Are there any open problems left about DFAs?
19
Is there a non-deterministic linear time algorithm for CNF-SAT?
18
What is the minimum complexity oracle that separates PSPACE from the polynomial hierarchy?

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.