High speed pattern matching algorithm based on deterministic finite automata with faulty transition table

Jan Kastil, Jan Korenek. High speed pattern matching algorithm based on deterministic finite automata with faulty transition table. In Bill Lin, Jeffrey C. Mogul, Ravishankar R. Iyer, editors, Proceedings of the 2010 ACM/IEEE Symposium on Architecture for Networking and Communications Systems, ANCS 2010, San Diego, California, USA, October 25-26, 2010. pages 7, ACM, 2010. [doi]

@inproceedings{KastilK10,
  title = {High speed pattern matching algorithm based on deterministic finite automata with faulty transition table},
  author = {Jan Kastil and Jan Korenek},
  year = {2010},
  doi = {10.1145/1872007.1872017},
  url = {http://doi.acm.org/10.1145/1872007.1872017},
  tags = {rule-based, pattern matching},
  researchr = {https://researchr.org/publication/KastilK10},
  cites = {0},
  citedby = {0},
  pages = {7},
  booktitle = {Proceedings of the 2010 ACM/IEEE Symposium on Architecture for Networking and Communications Systems, ANCS 2010, San Diego, California, USA, October 25-26, 2010},
  editor = {Bill Lin and Jeffrey C. Mogul and Ravishankar R. Iyer},
  publisher = {ACM},
  isbn = {978-1-4503-0379-8},
}