For example, the parity language 0* (10*10*)* contains strings with an even number of occurrences of the factor "1".
intuitively, it seems improbable that similar counting constraints occur in natural language grammars many regular expressions in Voutilainen's ENGFSiG (1994) involve the Kleene star.