Advertisement

A New Approach to Determinisation Using Bit-Parallelism

  • Jan Šupol
  • Bořivoj Melichar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4281)

Abstract

We present a new approach to the determinisation process of specified types of automata using bit-parallel algorithms. We present the determinisation of nondeterministic pattern matching automata (PMA) for approximate pattern matching and we introduce the determinisation of suffix automata. This new approach speeds the determinisation up to m times, where m is the length of the pattern searched by PMA, or accepted by the suffix automaton, respectively.

Keywords

Pattern Match Initial Vector String Match Determinisation Process Edit Operation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BYG92]
    Baeza-Yates, R.A., Gonnet, G.H.: A new approach to text searching. Commun. ACM 35(10), 74–82 (1992)CrossRefGoogle Scholar
  2. [Döm64]
    Dömölki, B.: An algorithm for syntactic analysis. Computational Linguistics 8, 29–46 (1964)Google Scholar
  3. [Ham86]
    Hamming, R.W.: Coding and information theory, 2nd edn. Prentice-Hall, Inc., Upper Saddle River (1986)zbMATHGoogle Scholar
  4. [HMU01]
    Hopcroft, J.E., Motwani, R., Ulman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (2001)zbMATHGoogle Scholar
  5. [Hol00]
    Holub, J.: Simulation of Nondeterministic Finite Automata in Pattern Matching. Ph.D. Thesis, Czech Technical University in Prague (February 2000)Google Scholar
  6. [NR98]
    Navarro, G., Raffinot, M.: A bit-parallel approach to suffix automata: Fast extended string matching. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol. 1448, pp. 14–33. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  7. [WM92]
    Wu, S., Manber, U.: Fast text searching allowing errors. Commun. ACM 35(10), 83–91 (1992)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jan Šupol
    • 1
  • Bořivoj Melichar
    • 1
  1. 1.Department of Computer Science & Engineering, Faculty of Electrical EngineeringCzech Technical University in PraguePrague 2

Personalised recommendations