Abstract
Given a set of strings, the subsequence automaton accepts all subsequences of these strings. We derive a lower bound for the maximum number of states of this automaton. We prove that the size of the subsequence automaton for a set of k strings of length n is Ω(nk/(k+1)kk!) for any k≥1. It solves an open problem because only the case k≤2 was shown before.
Original language | English |
---|---|
Pages (from-to) | 379-384 |
Number of pages | 6 |
Journal | Theoretical Computer Science |
Volume | 341 |
Issue number | 1-3 |
DOIs | |
Publication status | Published - 2005 Sep 5 |
Externally published | Yes |
Keywords
- Directed acyclic subsequence graph
- Searching subsequences
- Subsequence automaton
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)