Extending finite automata to efficiently match Perl-compatible regular expressions

@inproceedings{Becchi2008ExtendingFA,
  title={Extending finite automata to efficiently match Perl-compatible regular expressions},
  author={Michela Becchi and Patrick Crowley},
  booktitle={CoNEXT},
  year={2008}
}

• Michela Becchi, Patrick Crowley
• Published in CoNEXT 2008
• DOI:10.1145/1544012.1544037

Regular expression matching is a crucial task in several networking applications. Current implementations are based on one of two types of finite state machines. Non-deterministic finite automata (NFAs) have minimal storage demand but have high memory bandwidth requirements. Deterministic finite automata (DFAs) exhibit low and deterministic memory bandwidth requirements at the cost of increased memory space. It has already been shown how the presence of wildcards and repetitions of large… CONTINUE READING

View on ACM

Save to Library

Create Alert

Cite