Skip to main content
Theoretical Computer Science

Return to Question

edited tags
Link
Kaveh
Kaveh
  • 21.8k
  • 8
  • 84
  • 185
Post Migrated Away to cs.stackexchange.com by Kaveh
Post Locked by CommunityBot
Post Closed as "off topic" by Kaveh
Post Reopened by Kaveh
Post Unlocked by Kaveh
Post Locked by CommunityBot
Post Closed as "off topic" by Kaveh
Post Reopened by Kaveh
Migration Rejected
Post Unlocked by CommunityBot
Post Locked by CommunityBot
Post Closed as "off topic" by Kaveh
Post Unlocked by Kaveh
Post Reopened by Kaveh
Post Locked by CommunityBot
Post Closed as "off topic" by Kaveh
Post Reopened by Kaveh
Post Unlocked by Kaveh
Post Locked by CommunityBot
Post Closed as "off topic" by Kaveh
Post Reopened by Kaveh
Post Undeleted by Kaveh
Post Closed as "off topic" by Jukka Suomela, Artem Kaznatcheev♦, Kaveh
Source Link
Simon S
Simon S
  • 101
  • 1

Is there a context free, non-regular language L, so that L* is regular?

I know that there are non-regular languages, so that L* is regular, but all examples I can find are context senitive but not context free.

In case there are none how do you proof it?