Simplifying Regular Expressions
From MaRDI portal
Publication:3564869
DOI10.1007/978-3-642-13089-2_24zbMath1284.68351OpenAlexW1882260133MaRDI QIDQ3564869
Publication date: 26 May 2010
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13089-2_24
Related Items (9)
Simplifying regular expressions further ⋮ Manipulation of regular expressions using derivatives: an overview ⋮ A hitchhiker's guide to descriptional complexity through analytic combinatorics ⋮ On Average Behaviour of Regular Expressions in Strong Star Normal Form ⋮ Descriptional complexity of regular languages ⋮ Enumerating regular expressions and their languages ⋮ Partial derivative automaton by compressing regular expressions ⋮ Analysis of an efficient reduction algorithm for random regular expressions based on universality detection ⋮ Efficient enumeration of regular expressions for faster regular expression synthesis
This page was built for publication: Simplifying Regular Expressions
