Matching patterns of an automaton

Research output: Chapter in Book/Report/Conference proceedingConference contribution


We present an algorithm permitting to search in a text for the patterns of a regular set. Unlike many classical algorithms, we shall assume that the input of the algorithm is a deterministic automaton and not a regular expression. Our algorithm is based on the notion of failure function and mainly consists in efficiently constructing a new deterministic automaton. This construction is shown to be more efficient both in time and space than naive algorithms such as the powerset algorithm used for determinization. In particular, its space complexity is linear in the size of the obtained automaton.

Original languageEnglish (US)
Title of host publicationCombinatorial Pattern Matching - 6th Annual Symposium, CPM 1995, Proceedings
EditorsZvi Galil, Esko Ukkonen
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3540600442, 9783540600442
StatePublished - 1995
Event6th Annual Symposium on Combinatorial Pattern Matching, CPM 1995 - Espoo, Finland
Duration: Jul 5 1995Jul 7 1995

Publication series

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


Other6th Annual Symposium on Combinatorial Pattern Matching, CPM 1995

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Matching patterns of an automaton'. Together they form a unique fingerprint.

Cite this