3. Finite Automata in Pattern Matching

  1. Mourad Elloumi2 and
  2. Albert Y. Zomaya3
  1. Jan Holub

Published Online: 23 DEC 2010

DOI: 10.1002/9780470892107.ch3

Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications

Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications

How to Cite

Holub, J. (2011) Finite Automata in Pattern Matching, in Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications (eds M. Elloumi and A. Y. Zomaya), John Wiley & Sons, Inc., Hoboken, NJ, USA. doi: 10.1002/9780470892107.ch3

Editor Information

  1. 2

    Unit of Technologies of Information and Communication (UTIC) and University of Tunis-El Manar, Tunisia

  2. 3

    School of Information Technologies, The University of Sydney, Australia

Author Information

  1. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Czech Republic

Publication History

  1. Published Online: 23 DEC 2010
  2. Published Print: 18 JAN 2011

ISBN Information

Print ISBN: 9780470505199

Online ISBN: 9780470892107

SEARCH

Keywords:

  • finite automata in pattern matching - approaches of finite automata use in stringology;
  • approach used in stringology, preprocessing text and not pattern - building automaton for input text, and pattern as input to finite automaton;
  • finite automaton as model of computation - finite automaton, in solving tasks, construction of DFA giving a solution

Summary

This chapter contains sections titled:

  • Introduction

  • Direct Use of DFA in Stringology

  • NFA Simulation

  • Finite Automaton as Model of Computation

  • Finite Automata Composition

  • Summary

  • References