The size of subsequence automaton

Zdeněk Troníček, Ayumi Shinohara

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Citation (Scopus)

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

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsMario A. Nascimento, Edleno S. de Moura, Arlindo L. Oliveira
PublisherSpringer Verlag
Pages304-310
Number of pages7
ISBN (Print)3540201777, 9783540201779
DOIs
Publication statusPublished - 2003
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2857
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'The size of subsequence automaton'. Together they form a unique fingerprint.

Cite this