The size of subsequence automaton

Zdeněk Troníček, Ayumi Shinohara

研究成果: Chapter

1 被引用数 (Scopus)

抄録

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íček [2] in 1999, in which only the case k ≤ 2 was shown.

本文言語English
ホスト出版物のタイトルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
編集者Mario A. Nascimento, Edleno S. de Moura, Arlindo L. Oliveira
出版社Springer Verlag
ページ304-310
ページ数7
ISBN(印刷版)3540201777, 9783540201779
DOI
出版ステータスPublished - 2003
外部発表はい

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2857
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「The size of subsequence automaton」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル