Finite Automata for Generalized Approach to Backward Pattern Matching

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F11%3A00241503" target="_blank" >RIV/68407700:21240/11:00241503 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007%2F978-3-642-18098-9_6" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-642-18098-9_6</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Finite Automata for Generalized Approach to Backward Pattern Matching
Original language description
We generalized the DAWG backward pattern matching approach to be able to solve a broad range of pattern matching problems. We use a definition of a class of problems. We describe a finite automaton for the basic pattern matching problem of finding an exact occurrence of one string in a text. We propose a mechanism to use simple operations over finite automata in a systematic approach to derive automata for solving problems from a defined class, such as approximate matching, regular expression matching,sequence matching, matching of set of patterns, etc. and their combinations. The benefit of this approach is the ability to quickly derive solutions for newly formulated pattern matching problems.
Czech name
—
Czech description
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the 15th International Conference on Implementation and Application of Automata
ISBN
978-3-642-18097-2
ISSN
0302-9743
e-ISSN
—
Number of pages
10
Pages from-to
49-58
Publisher name
Springer
Place of publication
Heidelberg
Event location
Winnipeg, Manitoba
Event date
Aug 12, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000290544800006

Similar results(10)