Squares of regular languages
β
Gerhard Lischke
π
Article
π
2005
π
John Wiley and Sons
π
English
β 127 KB
The square of a language L is the set of all words pp where p β L. The square of a regular language may be regular too or context-free or none of both. We give characterizations for each of these cases and show that it is decidable whether a regular language has one of these properties.