Papers
Topics
Authors
Recent
Search
2000 character limit reached

Inverse Star, Borders, and Palstars

Published 14 Aug 2010 in cs.FL and math.CO | (1008.2440v2)

Abstract: A language L is closed if L = L*. We consider an operation on closed languages, L-, that is an inverse to Kleene closure. It is known that if L is closed and regular, then L- is also regular. We show that the analogous result fails to hold for the context-free languages. Along the way we find a new relationship between the unbordered words and the prime palstars of Knuth, Morris, and Pratt. We use this relationship to enumerate the prime palstars, and we prove that neither the language of all unbordered words nor the language of all prime palstars is context-free.

Citations (8)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.