Advertisement

The Size of Subsequence Automaton

  • Zdeněk Troníček
  • Ayumi Shinohara
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2857)

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 Ω(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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baeza-Yates, R.A.: Searching subsequences. Theor. Comput. Sci. 78(2), 363–376 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Crochemore, M., Troníček, Z.: Directed acyclic subsequence graph for multiple texts. Rapport I.G.M. 99-13, Université de Marne-la-Vallée (1999)Google Scholar
  3. 3.
    Crochemore, M., Troníček, Z.: On the size of DASG for multiple texts. In: Proceedings of the Symposium on String Processing and Information Retrieval 2002, Lisbon, pp. 58–64 (2002)Google Scholar
  4. 4.
    Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S.: Online construction of subsequence automata for multiple texts. In: Proceedings of the Symposium on String Processing and Information Retrieval 2000, La Coruña, Spain, IEEE Computer Society Press, Los Alamitos (2000)Google Scholar
  5. 5.
    Sloane, N.J.A.: The on-line encyclopedia of integer sequences, http://www.research.att.com/~njas/sequences/
  6. 6.
    Troníček, Z.: Common subsequence automaton. In: International Conference on Implementation and Application of Automata 2002, Tours, France (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Zdeněk Troníček
    • 1
  • Ayumi Shinohara
    • 2
    • 3
  1. 1.Department of Computer Science & Engineering, Faculty of Electrical EngineeringCzech Technical UniversityPrague
  2. 2.Department of InformaticsKyushu University 33FukuokaJapan
  3. 3.PRESTO, Japan Science and Technology Corporation (JST) 

Personalised recommendations