@inbook{1c1ff0dbbb564d98ad5206f53f8dc2cf,

title = "The size of subsequence automaton",

abstract = "Given a set of strings, the subsequence automaton accepts all subsequences of these strings. We will derive a lower bound for the maximum number of states of this automaton. We will prove that the size of the subsequence automaton for a set of k strings of length n is Ω(nk) for any k ≥ 1. It solves an open problem posed by Crochemore and Tron{\'i}{\v c}ek [2] in 1999, in which only the case k ≤ 2 was shown.",

author = "Zden{\v e}k Tron{\'i}{\v c}ek and Ayumi Shinohara",

year = "2003",

doi = "10.1007/978-3-540-39984-1_23",

language = "English",

isbn = "3540201777",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "304--310",

editor = "Nascimento, {Mario A.} and {de Moura}, {Edleno S.} and Oliveira, {Arlindo L.}",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}