Common Subsequence Automaton
Zdeněk Tronı́ček · 2002
Given a set of strings, a common subsequence of this set is a string that is a subsequence of each string in this set. We describe an on-line algorithm building the nite automaton which accepts all common subsequences of the given set of strings.