Skip to main content
10 events
when toggle format what by license comment
S Sep 12, 2013 at 12:21 history suggested Sergiy Kozerenko CC BY-SA 3.0
TeX and text clarification
Sep 12, 2013 at 12:18 review Suggested edits
S Sep 12, 2013 at 12:21
Jun 23, 2011 at 1:54 answer added Benjamin Steinberg timeline score: 1
Jan 13, 2011 at 15:05 comment added Yuval Filmus @vincenzoml: See my answer on cstheory, part 3. As you mention, the correct normal form is a union of $r^+$'s, which unfortunately in general cannot be disjoint.
Jan 13, 2011 at 13:04 comment added vincenzoml Yes I am interested in the regular languages that satisfy the condition I spelled. In fact I am only interested in languages that don't contain the empty word, but that's a separate condition. Sorry for the crosspost, I did not know what was the most appropriate place for the question. Maybe following up just on cstheory is better. A language is not circular if L=M* (and L=M+ does not fix this) as Lukasz Grabowski points out with his example. Yuval Filmus: is what you say that obvious? How do you identify the generators (your "r").
Jan 12, 2011 at 16:35 comment added Yuval Filmus Cross-posted on cstheory: cstheory.stackexchange.com/questions/4254/….
Jan 12, 2011 at 14:39 comment added Klaus Draeger Just to clarify: You are really only interested in languages which satisfy the cyclicity condition and are, in addition, regular? I ask because the condition itself does not imply regularity - consider, for example, the language of well-matched parentheses.
Jan 12, 2011 at 8:00 answer added Dylan Thurston timeline score: 2
Jan 11, 2011 at 15:29 comment added Qiaochu Yuan There is a related notion of a cyclic language: they are closed under conjugation and powers. See crm.umontreal.ca/Words07/pdf/musikerslides.pdf .
Jan 11, 2011 at 14:54 history asked vincenzoml CC BY-SA 2.5