scientific article; zbMATH DE number 7561695
From MaRDI portal
Publication:5092413
DOI10.4230/LIPIcs.MFCS.2019.51MaRDI QIDQ5092413
Cyril Nicaud, Pablo Rotondo, Florent Koechlin
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (6)
On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations ⋮ Random Regular Expression Over Huge Alphabets ⋮ The effects of semantic simplifications on random \textit{BST}-like expression-trees ⋮ Simplifications of Uniform Expressions Specified by Systems ⋮ On the uniform distribution of regular expressions ⋮ Analysis of an efficient reduction algorithm for random regular expressions based on universality detection
Cites Work
- The average height of binary trees and other simple trees
- Automata, languages and programming. 17th international colloquium, Warwick University, England, July 16--20, 1990. Proceedings
- On an asymptotic method in enumeration
- Characteristic points of recursive systems
- A sprouting tree model for random boolean functions
- Random Trees
- On the Average Size of Glushkov’s Automata
- A complexity calculus for recursive tree algorithms
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- And/or trees: A local limit point of view
- Implementation and Application of Automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
