Skip to main content
Tour
About Us
Meta
Loading…
current community
Stack Exchange
chat
Meta Stack Exchange
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
company blog
Log in
Stack Exchange
Top 400 Users
Digests
Optimistic
top
accounts
reputation
activity
subscriptions
Top Questions
5
votes
Can we check in polynomial time if the language of a DFA is closed against Kleene star?
algorithms
complexity-theory
regular-languages
time-complexity
asked Apr 27, 2015 at 23:25
cs.stackexchange.com
Top Answers
No answers with score of 5 or more
Stack Exchange works best with JavaScript enabled
