Tweeted twitter.com/#!/StackCompSci/status/319357446017646592

occurred Apr 3, 2013 at 7:55

edited tags

Link

edited Apr 3, 2013 at 7:10

Post Reopened by templatetypedef, vonbrand, Gilles 'SO- stop being evil'

occurred Apr 2, 2013 at 22:32

Proper name capitalization

Source Link

edited Apr 2, 2013 at 16:40

Is every regular language turingTuring-decidable, and how can we prove this?

I know every regular language is turingTuring-acceptable, but does that imply it is turingTuring-decidable?

edited title

Link

edited Apr 2, 2013 at 15:22

Is every regular language turing-decidable, and how can we prove this?

Post Closed as "not a real question" by Raphael

occurred Apr 2, 2013 at 15:21

edited tags

Link

edited Apr 2, 2013 at 15:21

Loading

Source Link

asked Apr 2, 2013 at 13:51

Loading