Random Regular Expression Over Huge Alphabets
From MaRDI portal
Recommendations
Cites work
- Analytic combinatorics
- scientific article; zbMATH DE number 7075888 (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 equation automata for KAT 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 Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations
- Uniform random expressions lack expressivity
Cited in
(7)- On the average complexity of strong star normal form
- Cardinality estimates for some classes of regular languages
- On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations
- Uniform random expressions lack expressivity
- On average behaviour of regular expressions in strong star normal form
- Simplifications of Uniform Expressions Specified by Systems
- Regular expressions avoiding absorbing patterns and the significance of uniform distribution
This page was built for publication: Random Regular Expression Over Huge Alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6114829)
