Compressing Regular Expressions’ DFA Table by Matrix Decomposition

DOI10.1007/978-3-642-18098-9_30zbMath1297.68152OpenAlexW1489967740MaRDI QIDQ3073647

No author found.

Publication date: 11 February 2011

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18098-9_30

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Uses Software

• Snort

Cites Work

• Unnamed Item
• A Four Russians algorithm for regular expression pattern matching
• Fast text searching for regular expressions or automaton searching on tries
• Compact and fast algorithms for safe regular expression search
• Programming Techniques: Regular expression search algorithm
• Space/time trade-offs in hash coding with allowable errors

This page was built for publication: Compressing Regular Expressions’ DFA Table by Matrix Decomposition