Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
143 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Inverse Star, Borders, and Palstars (1008.2440v2)

Published 14 Aug 2010 in cs.FL and math.CO

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

We haven't generated a summary for this paper yet.