Simplifications of Uniform Expressions Specified by Systems

DOI10.1142/S0129054121420065MaRDI QIDQ6169899zbMATH OpenOpenAlexFDO

Authors Florent Koechlin, Cyril Nicaud, 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

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

Recommendations

• Simplifying algebraic functional systems
• On simplification of formulas with unconstrained variables and quantifiers
• scientific article; zbMATH DE number 1175416
• scientific article; zbMATH DE number 3867760
• Uniform annihilators of systems of parameters
• scientific article; zbMATH DE number 2079021
• Systems of reductions
• scientific article; zbMATH DE number 1802660
• On representing systems for functions of several variables
• Computer simplification of formulas in linear systems theory

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 986989 (Why is no real title available?)
• scientific article; zbMATH DE number 177816 (Why is no real title available?)
• scientific article; zbMATH DE number 1080355 (Why is no real title available?)
• scientific article; zbMATH DE number 1111371 (Why is no real title available?)
• scientific article; zbMATH DE number 845550 (Why is no real title available?)
• scientific article; zbMATH DE number 7075888 (Why is no real title available?)
• scientific article; zbMATH DE number 7561695 (Why is no real title available?)
• A complexity calculus for recursive tree algorithms
• Algorithms for combinatorial structures: well-founded systems and Newton iterations
• Analytic combinatorics
• Characteristic points of recursive systems
• Continuity and Location of Zeros of Linear Combinations of Polynomials
• Formulae and asymptotics for coefficients of algebraic functions
• Implementation and Application of Automata
• On an asymptotic method in enumeration
• On the Average Size of Glushkov’s Automata
• On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations
• On the richness of the collection of subtrees in random binary search trees
• Random Boolean expressions
• Random Regular Expression Over Huge Alphabets
• Random Trees
• Repeated fringe subtrees in random rooted trees
• The Distribution of Patterns in Random Trees
• The average height of binary trees and other simple trees
• Une théorie combinatoire des séries formelles
• XML compression via directed acyclic graphs

Cited in

(2)

• On simplification of formulas with unconstrained variables and quantifiers
• The effects of semantic simplifications on random \textit{BST}-like expression-trees

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

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