# Automata for Matching Patterns

@inproceedings{Crochemore1997AutomataFM,
title={Automata for Matching Patterns},
author={Maxime Crochemore and Christophe Hancart},
booktitle={Handbook of Formal Languages},
year={1997}
}
• Published in Handbook of Formal Languages 1 April 1997
• Biology
This chapter describes several methods of word pattern matching that are based on the use of automata.
127 Citations
• Computer Science
• 2012
Algorithms for solving several matching problems on Mazurkiewicz traces that recognize corresponding rational trace languages used in solving concrete problems that have analogs in stringology are presented.
• Computer Science
Cybernetics and Systems Analysis
• 2012
Algorithms for solving several matching problems on Mazurkiewicz traces that recognize corresponding rational trace languages used in solving concrete problems that have analogs in stringology are presented.
• Computer Science
CIAA
• 2005
The first of these two models presents an automata based version of the Bird and Baker approach with lower space complexity than the original algorithm, and a new model for two- dimensional approximate pattern matching using the two-dimensional Hamming distance is introduced.
• Computer Science
MFCS
• 1998
An automaton accepting L(M) and built from the language M, which is effective if M is finite, is designed and built.
This first paper presents the proposed non-deterministic pushdown automaton which will serve as a basis for the determinisation process, and proves its correctness.
• Computer Science
Comput. Sci. Inf. Syst.
• 2010
A systematic approach to the construction of subtree pattern matchers by deterministic pushdown automata, which read subject trees in prefix and postfix notation, is presented.
• Mathematics
Fundam. Informaticae
• 2006
A type of substitution operation inspired by errors occurring in biologically encoded information is introduced and the closure properties of language families in the Chomsky hierarchy under these substitution operations are derived.
This paper links classical combinatorial parameters on words to the size and the structure of the factor automa- ton and gives a characterization of the words having factor automaton with minimal number of states.
• Computer Science
2009 International Multiconference on Computer Science and Information Technology
• 2009
The method is analogous to the construction of string pattern matchers: for a given pattern, a nondeterministic pushdown automaton is created and then it is determinised, and it is shown that the size of the resulting deterministic push down automata directly corresponds to thesize of the existing string patternMatchers based on finite automata.

## References

SHOWING 1-10 OF 45 REFERENCES

• Imre Simon
• Computer Science
Results and Trends in Theoretical Computer Science
• 1994
The structure of finite automata recognizing sets of the form A*p, for some word p, is studied, and the results obtained are used to improve the Knuth-Morris-Pratt string searching algorithm.
A sufficient condition for an on-line algorithm to be transformed into a real-time algorithm is given. This condition is used to construct real-time algorithms for various string-matching problems by
• G. Stephen
• Computer Science, Physics
Lecture Notes Series on Computing
• 1994
String Matching String Distance and Common Sequences Suffix Trees Approximate String Matching Repeated Substrings.
• Computer Science
CPM
• 1992
In the dynamic dictionary matching problem, a dictionary D contains a set of patterns that can change over time by insertion and deletion of individual patterns. The user also presents text strings
Dictionary-matching is a generalization of the string- matching problem where one is looking simultaneously for all occurrences of several patterns in a single text.
I would like to make some further clarifying remarks about the nature of learning machines, or finite automata as they are more generally known these days. It is clear from much that has recently
• Computer Science
SIAM J. Comput.
• 1977
An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum of the lengths of the strings, showing that the set of concatenations of even palindromes, i.e., the language $\{\alpha \alpha ^R\}^*$, can be recognized in linear time.
A method for locating specific character strings embedded in character text is described and an implementation of this method in the form of a compiler is discussed. The compiler accepts a regular