Compressing regular expressions' DFA table by matrix decomposition
From MaRDI portal
Publication:3073647
DOI10.1007/978-3-642-18098-9_30zbMATH Open1297.68152OpenAlexW1489967740MaRDI QIDQ3073647FDOQ3073647
Authors:
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
Recommendations
- SDFA: series DFA for memory-efficient regular expression matching
- scientific article; zbMATH DE number 1848391
- From regular expressions to DFA's using compressed NFA's
- Compact representations of automata for regular expression matching
- Regular expression matching algorithm based on parameters setting
Cites Work
- Space/time trade-offs in hash coding with allowable errors
- Programming Techniques: Regular expression search algorithm
- A Four Russians algorithm for regular expression pattern matching
- Compact and fast algorithms for safe regular expression search
- Fast text searching for regular expressions or automaton searching on tries
- Title not available (Why is that?)
Cited In (2)
Uses Software
This page was built for publication: Compressing regular expressions' DFA table by matrix decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073647)