Analysis of an efficient reduction algorithm for random regular expressions based on universality detection

DOI10.1007/978-3-030-79416-3_12OpenAlexW3175748299MaRDI QIDQ2117090

Pablo Rotondo, Florent Koechlin

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-79416-3_12

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular expressions into finite automata
• Follow automata.
• Simulating Size-constrained Galton–Watson Trees
• Simplifying Regular Expressions
• Partial derivatives of regular expressions and finite automata constructions
• ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA
• The growing tree distribution on Boolean functions.
• Implementation and Application of Automata
• A Unified Construction of the Glushkov, Follow, and Antimirov Automata

This page was built for publication: Analysis of an efficient reduction algorithm for random regular expressions based on universality detection