Compact representations of automata for regular expression matching
From MaRDI portal
Publication:738883
DOI10.1016/J.IPL.2016.07.003zbMATH Open1371.68169OpenAlexW2481495589MaRDI QIDQ738883FDOQ738883
Authors: Meng Zhang, Yi Zhang, Chen Hou 
Publication date: 16 August 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2016.07.003
Recommendations
Cites Work
- Title not available (Why is that?)
- Algorithms on Strings, Trees and Sequences
- THE ABSTRACT THEORY OF AUTOMATA
- Partial derivatives of regular expressions and finite automaton constructions
- Fast and compact regular expression matching
- Perfect hashing
- Follow automata.
- A Unified Construction of the Glushkov, Follow, and Antimirov Automata
- New techniques for regular expression searching
- Title not available (Why is that?)
- Programming Techniques: Regular expression search algorithm
- New Algorithms for Regular Expression Matching
- Faster Regular Expression Matching
- A Four Russians algorithm for regular expression pattern matching
- From regular expressions to deterministic automata
- Compact and fast algorithms for safe regular expression search
Cited In (9)
- Space-Efficient Representations for Glushkov Automata
- Title not available (Why is that?)
- New techniques for regular expression searching
- Title not available (Why is that?)
- Series-Parallel Automata and Short Regular Expressions
- Compressing regular expressions' DFA table by matrix decomposition
- Smaller representation of finite state automata
- SDFA: series DFA for memory-efficient regular expression matching
- Title not available (Why is that?)
This page was built for publication: Compact representations of automata for regular expression matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q738883)
