M.K. Dadsetani

Member for 11 years
Last seen more than a month ago

IRAN

Network profile

Summary

Reputation

354

354
349
344

2020
2021
2022
2023

Top tag

finite-automata

Next privilege

500 Rep.

Access review queues

Badges

3

8

Newest

Notable Question

Next badge

0/1

Informed

Answers

View all 6 answers

Score Activity Newest

11

NFA with exponential number of states when determinized

May 5, 2013

3

Use Rice's theorem to show that the language of optimisable Turing machines is undecidable

Jul 30, 2013

2

Regular expression for $\{a^k b^m c^n \mid k+m+n \text{ is odd} \}$

Feb 4, 2013

1

How to show that given language is unambiguous

Dec 21, 2012

0

How can a Turing Machine recognize a regular language?

Jul 31, 2013

Questions

Score Activity Newest Views

5

Deterministic context-free languages are closed under regular right-product

Nov 30, 2012

2

How can I prove that the language of a read-only Turing machines is regular?

Dec 15, 2012

Tags

View all 18 tags

finite-automata

11

Score

2

posts

automata

11

Score

2

posts

computability

3

Score

1

post

undecidability

3

Score

1

post

rice-theorem

3

Score

1

post

Reputation

This user has no recent positive reputation changes.

Badges

View all badges

This user doesn’t have any gold badges yet.

3

silver badges

Necromancer

May 5, 2013
Notable Question

Mar 2, 2019
Yearling

Jan 12, 2018

8

bronze badges

Critic

Oct 29, 2018
Nice Answer

Jan 12, 2018
Teacher

Dec 21, 2012

Accounts

View all 15 accounts

521
1
6
14

Computer Science

354
3
8

160
6

131
2

Motor Vehicle Maintenance & Repair

121
1
5

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast

11

upvotes

1

downvotes

12

answer votes