Simplifications of Uniform Expressions Specified by Systems
From MaRDI portal
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
- 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
- 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?)
- 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 average height of binary trees and other simple trees
- The Distribution of Patterns in Random Trees
- Une théorie combinatoire des séries formelles
- Uniform random expressions lack expressivity
- XML compression via directed acyclic graphs
Cited in
(6)- On simplification of formulas with unconstrained variables and quantifiers
- On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations
- Uniform random expressions lack expressivity
- The effects of semantic simplifications on random \textit{BST}-like expression-trees
- Heuristic universality detection over regular expressions specified by systems
- Random deterministic automata with one added transition
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)
