On Average Behaviour of Regular Expressions in Strong Star Normal Form
From MaRDI portal
Publication:5205036
DOI10.1142/S0129054119400227zbMath1427.68138MaRDI QIDQ5205036
António Machiavelo, Rogério Reis, Nelma Moreira, Sabine Broda
Publication date: 10 December 2019
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
regular expressionsPuiseux seriesanalytic combinatoricsstar normal formasymptotic average case complexityconversions into finite automata
Related Items (7)
Random Regular Expression Over Huge Alphabets ⋮ On the average complexity of partial derivative transducers ⋮ On the Average State Complexity of Partial Derivative Transducers ⋮ On the size of partial derivatives and the word membership problem ⋮ On the uniform distribution of regular expressions ⋮ Partial derivative automaton by compressing regular expressions ⋮ Efficient enumeration of regular expressions for faster regular expression synthesis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial derivatives of regular expressions and finite automaton constructions
- Regular expressions into finite automata
- Follow automata.
- Canonical derivatives, partial derivatives and finite automaton constructions.
- On the average complexity of strong star normal form
- A hitchhiker's guide to descriptional complexity through analytic combinatorics
- ON THE AVERAGE STATE COMPLEXITY OF PARTIAL DERIVATIVE AUTOMATA: AN ANALYTIC COMBINATORICS APPROACH
- THE ABSTRACT THEORY OF AUTOMATA
- Simplifying Regular Expressions
- On the Average Size of Glushkov’s Automata
- ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA
- NORMALIZED EXPRESSIONS AND FINITE AUTOMATA
- Programming Techniques: Regular expression search algorithm
- Design of Sequential Machines from Their Regular Expressions
- Algebra.
This page was built for publication: On Average Behaviour of Regular Expressions in Strong Star Normal Form
