Partial derivative automaton by compressing regular expressions
From MaRDI portal
Publication:2096587
Cites work
- Algorithms on Strings
- Analytic combinatorics
- Canonical derivatives, partial derivatives and finite automaton constructions.
- Fast equation automaton computation
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
- 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 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 derivatives of regular expressions and finite automaton constructions
- Regular expressions into finite automata
- Simplifying regular expressions. A quantitative perspective
- Variations on the Common Subexpression Problem
Cited in
(6)- Manipulation of regular expressions using derivatives: an overview
- Prefix and Right-Partial Derivative Automata
- Partial Derivative Automaton for Regular Expressions with Shuffle
- Location automata for regular expressions with shuffle and intersection
- Language quotients revisited
- Compressed structures for partial derivative automata constructions
This page was built for publication: Partial derivative automaton by compressing regular expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096587)
