Skip to main content
Computer Science
Frank's user avatar
Frank's user avatar
Frank's user avatar
Frank
  • Member for 4 years, 7 months
  • Last seen more than 3 years ago
Profile Activity
Stats
147
reputation
3k
reached
3
answers
15
questions
Communities
Badges
This user doesn’t have any gold badges yet.
This user doesn’t have any silver badges yet.
7
bronze badges
Top tags
View all tags
5
Score
4
Posts
22
Posts %
3
Score
5
Posts
28
Posts %
3
Score
4
Posts
22
Posts %
0
Score
7
Posts
39
Posts %
0
Score
4
Posts
22
Posts %
0
Score
3
Posts
17
Posts %
Top posts
View all questions and answers
question
3
If $A$ is context-free then $A^*$ is regular
Jul 22, 2020
answer
3
If $A$ is context-free then $A^*$ is regular
Jul 22, 2020
answer
2
Proof that $L=\{a^ncb^n| n \in \mathbb{N}\}$ is not regular
Jul 23, 2020
question
1
CFG for a given languague
May 23, 2020
question
1
How to prove the language of all Turing Machines that accept an undecidable language is undecidable?
Jul 25, 2020
question
1
Solving T(n) = 2*T(n-1)+4 witht the Master Theorem
Nov 29, 2020
question
1
Solving $T(n)=3T(\lfloor \frac{n}{3}\rfloor) +2n\log n$
Nov 29, 2020
question
0
Equivalence between a TM and a changing TM
Jun 13, 2020
question
0
Is the languague L={<M>, M accepts a finite amount of words} decdidable?
Jul 17, 2020
question
0
Proof that $L=\{a^ncb^n| n \in \mathbb{N}\}$ is not regular
Jul 23, 2020