Faculty of Information Technology, BUT

Publication Details

Deterministický konečný automat pro vyhledání vzorů ve vysokorychlostních sítích

KAŠTIL Jan and KOŘENEK Jan. Deterministický konečný automat pro vyhledání vzorů ve vysokorychlostních sítích. In: Proceedings of the 14th Conference STUDENT EEICT 2008. Volume 2. Brno: Brno University of Technology, 2008, pp. 227-229. ISBN 978-80-214-3615-2.
English title
Deterministic Finite Automata for pattern matching in high speed networks
Type
conference paper
Language
czech
Authors
Kaštil Jan, Ing. (DCSY FIT BUT)
Kořenek Jan, doc. Ing., Ph.D. (DCSY FIT BUT)
Keywords
Deterministic Finite Automata, Pattern Matching
Abstract
This paper deals with pattern matching in high speed networks using Deterministic Finite Automaton. We propose new method how to reduce transition table size in multichar automaton. The method is based on shared decoder, which is used to transform input alphabet to alphabet with reduced number of symbols. According to our preliminary results, the transition table can be significantly reduced.
Published
2008
Pages
227-229
Proceedings
Proceedings of the 14th Conference STUDENT EEICT 2008
Series
Volume 2
Conference
Student EEICT 2008, Brno, CZ
ISBN
978-80-214-3615-2
Publisher
Brno University of Technology
Place
Brno, CZ
BibTeX
@INPROCEEDINGS{FITPUB8808,
   author = "Jan Ka\v{s}til and Jan Ko\v{r}enek",
   title = "Deterministick\'{y} kone\v{c}n\'{y} automat pro vyhled\'{a}n\'{i} vzor\r{u} ve vysokorychlostn\'{i}ch s\'{i}t\'{i}ch",
   pages = "227--229",
   booktitle = "Proceedings of the 14th Conference STUDENT EEICT 2008",
   series = "Volume 2",
   year = 2008,
   location = "Brno, CZ",
   publisher = "Brno University of Technology",
   ISBN = "978-80-214-3615-2",
   language = "czech",
   url = "https://www.fit.vut.cz/research/publication/8808"
}
Back to top