The following pages link to Pablo Rotondo (Q2117089):
Displaying 11 items.
- Analysis of an efficient reduction algorithm for random regular expressions based on universality detection (Q2117090) (← links)
- Analysis of the continued logarithm algorithm (Q2294741) (← links)
- Lochs-type theorems beyond positive entropy (Q2696254) (← links)
- Recurrence Function on Sturmian Words: A Probabilistic Study (Q2946329) (← links)
- On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations (Q5041257) (← links)
- (Q5092413) (← links)
- The recurrence function of a random Sturmian word (Q5195041) (← links)
- Two Arithmetical Sources and Their Associated Tries (Q5874402) (← links)
- Random Regular Expression Over Huge Alphabets (Q6114829) (← links)
- The effects of semantic simplifications on random \textit{BST}-like expression-trees (Q6124452) (← links)
- Simplifications of Uniform Expressions Specified by Systems (Q6169899) (← links)
