Analysis of an efficient reduction algorithm for random regular expressions based on universality detection
From MaRDI portal
Publication:2117090
Recommendations
- On the uniform distribution of regular expressions
- Efficient testing and matching of deterministic regular expressions
- Simplifying regular expressions. A quantitative perspective
- Efficient enumeration of regular expressions for faster regular expression synthesis
- Descriptional complexity of deterministic regular expressions
- Quantitative Verification of Stochastic Regular Expressions
- On classes of tractable unrestricted regular expressions
- Tight Bounds on the Descriptional Complexity of Regular Expressions
- On regular expression hashing to reduce FA size
- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
Cites work
- scientific article; zbMATH DE number 986989 (Why is no real title available?)
- scientific article; zbMATH DE number 1080355 (Why is no real title available?)
- scientific article; zbMATH DE number 7561695 (Why is no real title available?)
- A Unified Construction of the Glushkov, Follow, and Antimirov Automata
- Analytic combinatorics
- Follow automata.
- Implementation and Application of Automata
- On the average size of Glushkov and partial derivative automata
- Partial derivatives of regular expressions and finite automata constructions
- Random Boolean expressions
- Regular expressions into finite automata
- Simplifying regular expressions. A quantitative perspective
- Simulating size-constrained Galton-Watson trees
- The growing tree distribution on Boolean functions.
This page was built for publication: Analysis of an efficient reduction algorithm for random regular expressions based on universality detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117090)
