The Size of Subsequence Automaton

Zdeněk Troníček,Ayumi Shinohara

doi:10.1007/978-3-540-39984-1_23

The Size of Subsequence Automaton

Zdeněk Troníček, Ayumi Shinohara

https://doi.org/10.1007/978-3-540-39984-1_23

Copy DOI

Publication Date: Jan 1, 2003

Citations: 4

Affiliation: Czech Technical University in Prague, Kyushu University, Japan Science and Technology Agency

#Subsequence Automaton #Strings Of Length + Show 3 more

Abstract
Full-Text PDF
Similar Papers

Abstract

AbstractGiven 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 Ω(n k) for any k≥ 1. It solves an open problem posed by Crochemore and Troníček [2] in 1999, in which only the case k≤ 2 was shown.

Full Text