On average behaviour of regular expressions in strong star normal form
From MaRDI portal
Publication:5205036
DOI10.1142/S0129054119400227zbMATH Open1427.68138MaRDI QIDQ5205036FDOQ5205036
Authors: Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis 
Publication date: 10 December 2019
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
- On the average complexity of strong star normal form
- Random Regular Expression Over Huge Alphabets
- scientific article; zbMATH DE number 7075888
- On the average complexity of partial derivative automata for semi-extended expressions
- On the state complexity of partial derivative automata for regular expressions with intersection
regular expressionsanalytic combinatoricsPuiseux seriesstar normal formasymptotic average case complexityconversions into finite automata
Cites Work
- Analytic combinatorics
- THE ABSTRACT THEORY OF AUTOMATA
- Elements of automata theory. Translated from the French by Reuben Thomas
- Title not available (Why is that?)
- Partial derivatives of regular expressions and finite automaton constructions
- Title not available (Why is that?)
- Follow automata.
- Title not available (Why is that?)
- Programming Techniques: Regular expression search algorithm
- Regular expressions into finite automata
- Canonical derivatives, partial derivatives and finite automaton constructions.
- NORMALIZED EXPRESSIONS AND FINITE AUTOMATA
- Simplifying regular expressions. A quantitative perspective
- Algebra.
- A hitchhiker's guide to descriptional complexity through analytic combinatorics
- On the average state complexity of partial derivative automata: an analytic combinatorics approach
- On the Average Size of Glushkov’s Automata
- On the average size of Glushkov and partial derivative automata
- Design of Sequential Machines from Their Regular Expressions
- On the average complexity of strong star normal form
Cited In (12)
- A hitchhiker's guide to descriptional complexity through analytic combinatorics
- Efficient enumeration of regular expressions for faster regular expression synthesis
- On the average state complexity of partial derivative transducers
- On the size of partial derivatives and the word membership problem
- Title not available (Why is that?)
- On the average complexity of strong star normal form
- Random Regular Expression Over Huge Alphabets
- Regular Expressions on Average and in the Long Run
- On the average complexity of partial derivative transducers
- Extended regular expressions of star degree at most two
- On the uniform distribution of regular expressions
- Partial derivative automaton by compressing regular expressions
Uses Software
This page was built for publication: On average behaviour of regular expressions in strong star normal form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205036)
