Simplifications of Uniform Expressions Specified by Systems

DOI10.1142/s0129054121420065zbMath1518.68179OpenAlexW3186680747MaRDI QIDQ6169899

Cyril Nicaud, Florent Koechlin, Pablo Rotondo

Publication date: 15 August 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054121420065

zbMATH Keywords

analytic combinatoricssimplification of expressionsrandom expressions

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Formal languages and automata (68Q45)

Related Items (1)

The effects of semantic simplifications on random \textit{BST}-like expression-trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• XML compression via directed acyclic graphs
• On the richness of the collection of subtrees in random binary search trees
• Algorithms for combinatorial structures: well-founded systems and Newton iterations
• Une théorie combinatoire des séries formelles
• The average height of binary trees and other simple trees
• On an asymptotic method in enumeration
• Characteristic points of recursive systems
• Random Trees
• On the Average Size of Glushkov’s Automata
• A complexity calculus for recursive tree algorithms
• On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations
• Repeated fringe subtrees in random rooted trees
• Continuity and Location of Zeros of Linear Combinations of Polynomials
• Formulae and Asymptotics for Coefficients of Algebraic Functions
• The Distribution of Patterns in Random Trees
• Implementation and Application of Automata
• Random Regular Expression Over Huge Alphabets

This page was built for publication: Simplifications of Uniform Expressions Specified by Systems