bn:03270460n
Noun Concept
EL
αστέρι χωρίς γλώσσα
EN
A regular language is said to be star-free if it can be described by a regular expression constructed from the letters of the alphabet, the empty set symbol, all boolean operators – including complementation – and concatenation but no Kleene star. Wikipedia
Relations
Sources