Compressed structures for partial derivative automata constructions
From MaRDI portal
Cites work
- Algorithms on Strings
- Automata for regular expressions with shuffle
- Canonical derivatives, partial derivatives and finite automaton constructions.
- Fast equation automaton computation
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
- From Mirkin's prebases to Antimirov's word partial derivatives
- scientific article; zbMATH DE number 3167270 (Why is no real title available?)
- scientific article; zbMATH DE number 177816 (Why is no real title available?)
- scientific article; zbMATH DE number 3549966 (Why is no real title available?)
- On average behaviour of regular expressions in strong star normal form
- On the average complexity of partial derivative automata for semi-extended expressions
- On the average size of Glushkov and partial derivative automata
- On the Average Size of Glushkov’s Automata
- On the average state complexity of partial derivative automata: an analytic combinatorics approach
- On the size of partial derivatives and the word membership problem
- Partial derivative automaton by compressing regular expressions
- Partial derivatives of regular expressions and finite automaton constructions
- Regular expressions into finite automata
- The edit distance to \(k\)-subsequence universality
- The prefix automaton
- Variations on the Common Subexpression Problem
- XML compression via directed acyclic graphs
This page was built for publication: Compressed structures for partial derivative automata constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7316810)
