subsequence_closure (361B)
1 # Subsequence closure 2 3 The *subsequence closure* of a [formal_language] L is the set of all [words] that are [subsequences] of a word of L 4 5 By definition it is a [subsequence_closed_language] 6 7 By [Higman's_lemma], the subsequence closure is always regular 8 9 See also: [subword_closure], [automaton_subsequence_closed], [supersequence_closure] 10 11 Up: [subsequence]