Extending finite automata to efficiently match Perl-compatible regular expressions

Michela Becchi, Patrick Crowley. Extending finite automata to efficiently match Perl-compatible regular expressions. In Arturo Azcorra, Gustavo de Veciana, Keith W. Ross, Leandros Tassiulas, editors, Proceedings of the 2008 ACM Conference on Emerging Network Experiment and Technology, CoNEXT 2008, Madrid, Spain, December 9-12, 2008. pages 25, ACM, 2008. [doi]

@inproceedings{BecchiC08:0,
  title = {Extending finite automata to efficiently match Perl-compatible regular expressions},
  author = {Michela Becchi and Patrick Crowley},
  year = {2008},
  doi = {10.1145/1544012.1544037},
  url = {http://doi.acm.org/10.1145/1544012.1544037},
  tags = {Perl},
  researchr = {https://researchr.org/publication/BecchiC08%3A0},
  cites = {0},
  citedby = {0},
  pages = {25},
  booktitle = {Proceedings of the 2008 ACM Conference on Emerging Network Experiment and Technology, CoNEXT 2008, Madrid, Spain, December 9-12, 2008},
  editor = {Arturo Azcorra and Gustavo de Veciana and Keith W. Ross and Leandros Tassiulas},
  publisher = {ACM},
  isbn = {978-1-60558-210-8},
}