Computer Science
Network profile
133
reputation
8

Da Mike

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

1
answer
8
questions
~608
people reached
  • Member for 7 months
  • 16 profile views
  • Last seen Nov 17 at 23:45

Communities (6)

Top network posts

Top tags (10)

Score 1
Posts 4
Posts % 44
Score 1
Posts 2
Score 1
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
2 Is $L(G) \subseteq L(R)$ decidable? Jun 18
2 Can such a Turing-recognizable language exist? Jun 16
2 Is the language L = {(a,b)* | #a * #b is an odd number} regular? Jun 12
1 Is $ L = \{ a^n\ |\ a^n \not\in L_n \} $ Turing recognizable (recursively enumerable)? Jun 15
1 Is $L = \{ \langle \langle \ M\ \rangle \rangle \ | \ M \ \text{does not accept}\ 010 \} $ Turing recognizeable? May 19
1 How precise to be when describing a Turing machine? May 5
1 Proving that L is not regular using closure properties Apr 23
0 Proving that L is not regular using closure properties Apr 23

Badges (8)

Gold

—

Silver

—

Bronze

8

Rarest