star_free_language (681B)
1 # Star free language 2 3 ## Definitions 4 5 - Language that can be defined from letters, empty set, empty word, and [boolean_operations] ([union], [intersection], [complement]) and [concatenation] but not [kleene_star] 6 - [aperiodic] [syntactic_monoid] 7 - characterization based on loops in the [automata] ([automaton_counter_free]) 8 - can always tested on the minimal automata ([automaton_minimization]) 9 10 ## Subclass 11 12 - [unambiguous_star_free_language] 13 14 See also: [star_height], [generalized_star_height], [first_order_logic], [kleene_star], [regular_expression_star_free], [schutzenbergers_theorem], [automaton_counter_free] 15 16 Up: [regular_language_family] 17 18 Aliases: star free languages