Simplifying regular expressions. A quantitative perspective
From MaRDI portal
Publication:3564869
Recommendations
- Provably Shorter Regular Expressions from Deterministic Finite Automata
- Translating regular expressions into small \(\epsilon \)-free nondeterministic finite automata
- scientific article; zbMATH DE number 1948484
- State elimination ordering strategies: some experimental results
- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
Cited in
(17)- Simplifying regular expressions further
- A hitchhiker's guide to descriptional complexity through analytic combinatorics
- Analysis of an efficient reduction algorithm for random regular expressions based on universality detection
- Efficient enumeration of regular expressions for faster regular expression synthesis
- STACS 2005
- On the quantitative semantics of regular expressions over real-valued signals
- On minimizing regular expressions without Kleene star
- Quantitative Verification of Stochastic Regular Expressions
- A benchmark production tool for regular expressions
- Manipulation of regular expressions using derivatives: an overview
- Semi-linear Parikh Images of Regular Expressions via Reduction
- Succinctness of the Complement and Intersection of Regular Expressions
- Descriptional complexity of regular languages
- Enumerating regular expressions and their languages
- Regular Expressions on Average and in the Long Run
- Partial derivative automaton by compressing regular expressions
- On average behaviour of regular expressions in strong star normal form
This page was built for publication: Simplifying regular expressions. A quantitative perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564869)
