Computer Science
Profile Activity
Network profile
243
reputation
2
9

Da Mike

Apparently, this user does not prefer to keep an air of mystery about them.

1
answer
8
questions
~4k
people reached
  • Member for 1 year, 11 months
  • 18 profile views
  • Last seen Apr 4 at 19:03

Communities (13)

Top network posts

Top tags (10)

Score 2
Posts 4
Posts % 44
Score 2
Posts 2
Score 2
Posts 2
Score 0
Posts 4
Score 0
Posts 3
Score 0
Posts 2
View all tags →

Top posts (9)

All Questions Answers
Votes Newest
2 Context free grammar for language with even number of $0$'s and $1$'s Jun 17 '19
2 Is $L(G) \subseteq L(R)$ decidable? Jun 18 '19
2 Can such a Turing-recognizable language exist? Jun 16 '19
2 Is the language L = {(a,b)* | #a * #b is an odd number} regular? Jun 12 '19
2 Proving that L is not regular using closure properties Apr 23 '19
1 Is $ L = \{ a^n\ |\ a^n \not\in L_n \} $ Turing recognizable (recursively enumerable)? Jun 15 '19
1 Is $L = \{ \langle \langle \ M\ \rangle \rangle \ | \ M \ \text{does not accept}\ 010 \} $ Turing recognizeable? May 19 '19
1 How precise to be when describing a Turing machine? May 5 '19
0 Proving that L is not regular using closure properties Apr 23 '19

Badges (11)

Gold

—

Silver

2

Rarest

Bronze

9

Rarest

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.