Efficient enumeration of regular expressions for faster regular expression synthesis

DOI10.1007/978-3-030-79121-6_6MaRDI QIDQ2117664zbMATH OpenOpenAlexFDO

Authors Su-Hyeon Kim, Hyeonseung Im, Sang-Ki Ko

Publication date 22 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-79121-6_6

zbMATH Keywords

normal formregular expressionprogram synthesisenumerative search

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 5595151 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 194974 (Why is no real title available?)
• scientific article; zbMATH DE number 3238653 (Why is no real title available?)
• Implementation and Application of Automata
• Implementation and Application of Automata
• On average behaviour of regular expressions in strong star normal form
• Regular expressions into finite automata
• Regular expressions: new results and open problems
• Regular-expression derivatives re-examined
• Simplifying regular expressions. A quantitative perspective

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

Describes a project that uses

Uses Software

• SoftRegex

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)