subsequence_automaton (456B)
1 # Subsequence automaton 2 3 A *subsequence [automaton]* for a [word] w is an [automaton] A that accepts precisely the [formal_language] of all [subsequences] of w, i.e., the [downwards_closure] of the [singleton_language] {w} 4 5 [Computational_problem]: Given a [word] w, we can [greedily] build a [DFA] subsequence automaton: stated as Observation 1 of [hofman2015separability] 6 7 Up: [subsequence] 8 9 See also: [common_subsequence_automaton], [downwards_closure]