Source: wikibot/star-free-language
= Star-free language
{wiki=Star-free_language}
A star-free language is a type of formal language in the context of automata theory and formal language theory. It is defined using a specific subset of regular expressions that do not involve the star operator (Kleene star, denoted as \`*\`), which allows for the repetition of patterns.