On Problems Related to Absent Subsequences
摘要
The paper introduces the absent subsequence automaton as a compact representation of shortest absent subsequences and minimal absent subsequences and describes its application to various related problems. It also reveals interesting combinatorial properties of minimal absent subsequences and derives an algorithm for computing the number of minimal absent subsequences.