Efficient enumeration of regular expressions for faster regular expression synthesis
From MaRDI portal
Publication:2117664
DOI10.1007/978-3-030-79121-6_6OpenAlexW3174857509MaRDI QIDQ2117664FDOQ2117664
Sang-Ki Ko, Su-Hyeon Kim, Hyeonseung Im
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-79121-6_6
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regular expressions into finite automata
- Regular-expression derivatives re-examined
- Simplifying Regular Expressions
- On Average Behaviour of Regular Expressions in Strong Star Normal Form
- Implementation and Application of Automata
- Implementation and Application of Automata
Cited In (6)
- Efficient Submatch Extraction for Practical Regular Expressions
- Efficient Enumeration of Regular Languages
- Analysis of an efficient reduction algorithm for random regular expressions based on universality detection
- Efficient testing and matching of deterministic regular expressions
- A benchmark production tool for regular expressions
- Automated grading of regular expressions
Uses Software
This page was built for publication: Efficient enumeration of regular expressions for faster regular expression synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117664)
