The size of subsequence automaton

Zdeněk Troníček; Ayumi Shinohara

doi:10.1016/j.tcs.2005.03.027

The size of subsequence automaton

Zdeněk Troníček, Ayumi Shinohara

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

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	https://doi.org/10.1016/j.tcs.2005.03.027
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)

Access to Document

10.1016/j.tcs.2005.03.027

Cite this

@article{b76a54ba051140f7934fc4718088a6a3,

title = "The size of subsequence automaton",

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.",

keywords = "Directed acyclic subsequence graph, Searching subsequences, Subsequence automaton",

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

year = "2005",

month = sep,

day = "5",

doi = "10.1016/j.tcs.2005.03.027",

language = "English",

volume = "341",

pages = "379--384",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - The size of subsequence automaton

AU - Troníček, Zdeněk

AU - Shinohara, Ayumi

PY - 2005/9/5

Y1 - 2005/9/5

N2 - 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.

AB - 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.

KW - Directed acyclic subsequence graph

KW - Searching subsequences

KW - Subsequence automaton

UR - http://www.scopus.com/inward/record.url?scp=23844557169&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=23844557169&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2005.03.027

DO - 10.1016/j.tcs.2005.03.027

M3 - Article

AN - SCOPUS:23844557169

VL - 341

SP - 379

EP - 384

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-3

ER -

The size of subsequence automaton

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this