Simplifications of Uniform Expressions Specified by Systems

DOI10.1142/S0129054121420065zbMATH Open1518.68179OpenAlexW3186680747MaRDI QIDQ6169899FDOQ6169899

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

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

zbMATH Keywords

analytic combinatoricssimplification of expressionsrandom expressions

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

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

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)