Efficient enumeration of regular expressions for faster regular expression synthesis

DOI10.1007/978-3-030-79121-6_6OpenAlexW3174857509MaRDI QIDQ2117664

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

zbMATH Keywords

normal formprogram synthesisregular expressionenumerative search

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Uses Software

• SoftRegex

Cites Work

• Regular expressions into finite automata
• Simplifying Regular Expressions
• Regular-expression derivatives re-examined
• On Average Behaviour of Regular Expressions in Strong Star Normal Form
• Implementation and Application of Automata
• Implementation and Application of Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient enumeration of regular expressions for faster regular expression synthesis