Skip to main content
Computer Science
M.K. Dadsetani's user avatar
M.K. Dadsetani's user avatar
M.K. Dadsetani's user avatar
M.K. Dadsetani
  • Member for 11 years, 10 months
  • Last seen more than a month ago
  • IRAN
Profile Activity
Stats
354
reputation
27k
reached
6
answers
2
questions
Communities
View all
About

I love every beautifully thing, the moon, the stars and galaxies, Orion, mathematics, pi and Euler numbers, Linux os, puzzles, clouds, cloud computation, Rice's Theorem, Quantum theory, Latex, computer science, ants, ... and the world!

Badges
This user doesn’t have any gold badges yet.
3
silver badges
8
bronze badges
Top tags
View all tags
11
Score
2
Posts
25
Posts %
11
Score
2
Posts
25
Posts %
3
Score
1
Posts
12
Posts %
3
Score
1
Posts
12
Posts %
2
Score
4
Posts
50
Posts %
0
Score
3
Posts
38
Posts %
Top posts
answer
11
NFA with exponential number of states when determinized
May 5, 2013
question
5
Deterministic context-free languages are closed under regular right-product
Nov 30, 2012
answer
3
Use Rice's theorem to show that the language of optimisable Turing machines is undecidable
Jul 30, 2013
question
2
How can I prove that the language of a read-only Turing machines is regular?
Dec 15, 2012
answer
2
Regular expression for $\{a^k b^m c^n \mid k+m+n \text{ is odd} \}$
Feb 4, 2013
answer
1
How to show that given language is unambiguous
Dec 21, 2012
answer
0
How can a Turing Machine recognize a regular language?
Jul 31, 2013
answer
-1
Is the language of pairs of words of equal length whose hamming distance is 2 or greater context-free?
Jun 15, 2013
Top network posts
View all network posts
13
How can I draw snake arrow in automata using tikz?
8
How can I put a picture alongside the chapter title?
6
reset counter when using \LTRfootnote from bidi package
5
How can put different watermarks on even an odd pages using draftwatermark
5
how to draw double circle nodes in tikz more clear?