Refine
Has Fulltext
- no (1)
Year of publication
- 2004 (1) (remove)
Document Type
- Article (1) (remove)
Language
- English (1)
Is part of the Bibliography
- yes (1) (remove)
Institute
The power of a language L is the set of all powers of the words in L. In this paper, the following decision problem is investigated. Given a context-free language L, is the power of L context-free? We show that this problem is decidable for languages over unary alphabets, but it is undecidable whenever languages over alphabets with at least two letters are considered. (C) 2003 Elsevier B.V. All rights reserved