Compact representations of automata for regular expression matching
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- A Four Russians algorithm for regular expression pattern matching
- A Unified Construction of the Glushkov, Follow, and Antimirov Automata
- Algorithms on Strings, Trees and Sequences
- Compact and fast algorithms for safe regular expression search
- Fast and compact regular expression matching
- Faster Regular Expression Matching
- Follow automata.
- From regular expressions to deterministic automata
- New Algorithms for Regular Expression Matching
- New techniques for regular expression searching
- Partial derivatives of regular expressions and finite automaton constructions
- Perfect hashing
- Programming Techniques: Regular expression search algorithm
- Regular expression matching with multi-strings and intervals
- THE ABSTRACT THEORY OF AUTOMATA
Cited in
(11)- Series-Parallel Automata and Short Regular Expressions
- Smaller representation of finite state automata
- Succinct representation for (non)deterministic finite automata
- New techniques for regular expression searching
- Compressing regular expressions' DFA table by matrix decomposition
- Regular expression matching algorithm based on parameters setting
- SDFA: series DFA for memory-efficient regular expression matching
- scientific article; zbMATH DE number 1848391 (Why is no real title available?)
- Space-efficient representations for Glushkov automata
- scientific article; zbMATH DE number 5717242 (Why is no real title available?)
- scientific article; zbMATH DE number 5903158 (Why is no real title available?)
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)
