Heuristic universality detection over regular expressions specified by systems

DOI10.1007/978-3-032-01475-7_19MaRDI QIDQ6861866zbMATH OpenFDO

Authors Florent Koechlin, Carine Pivoteau, Pablo Rotondo

Publication date 10 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-01475-7_19

zbMATH Keywords

analytic combinatoricsregexpsystemsuniversality

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A complexity calculus for recursive tree algorithms
• Algorithms for combinatorial structures: well-founded systems and Newton iterations
• Analysis of an efficient reduction algorithm for random regular expressions based on universality detection
• Analytic combinatorics
• Approximate NFA universality and related problems motivated by information theory
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• Characteristic points of recursive systems
• Formulae and asymptotics for coefficients of algebraic functions
• scientific article; zbMATH DE number 986989 (Why is no real title available?)
• scientific article; zbMATH DE number 3748431 (Why is no real title available?)
• Implementation and Application of Automata
• On the Average Size of Glushkov’s Automata
• On the average state complexity of partial derivative automata: an analytic combinatorics approach
• On the uniform distribution of regular expressions
• Simplifications of Uniform Expressions Specified by Systems
• Simplifying regular expressions further
• Simplifying regular expressions. A quantitative perspective
• Spectra and systems of equations

This page was built for publication: Heuristic universality detection over regular expressions specified by systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6861866)