Analysis of an efficient reduction algorithm for random regular expressions based on universality detection
From MaRDI portal
Publication:2117090
DOI10.1007/978-3-030-79416-3_12OpenAlexW3175748299MaRDI QIDQ2117090FDOQ2117090
Pablo Rotondo, Florent Koechlin
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-79416-3_12
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Follow automata.
- A Unified Construction of the Glushkov, Follow, and Antimirov Automata
- Title not available (Why is that?)
- Regular expressions into finite automata
- Partial derivatives of regular expressions and finite automata constructions
- The growing tree distribution on Boolean functions.
- Simplifying Regular Expressions
- ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA
- Implementation and Application of Automata
- Title not available (Why is that?)
- Simulating size-constrained Galton-Watson trees
Cited In (1)
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)
