Uniform random generation of expressions respecting algebraic identities (Q1179541)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 24899
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Uniform random generation of expressions respecting algebraic identities |
scientific article; zbMATH DE number 24899 |
Statements
Uniform random generation of expressions respecting algebraic identities (English)
0 references
26 June 1992
0 references
Algorithms for the uniform random generation of a class of formal expressions are considered. This class contains arithmetical expressions, tree representations, algebraic expressions and program structures. A modification of the algorithm for context-free languages from \textit{T. Hickey} and \textit{J. Cohen} [SIAM J. Comput. 12, 645-655 (1983; Zbl 0524.68046)] is used. A parallelizable algorithm for a speed up in the generation time is constructed.
0 references
uniform random generation
0 references
arithmetical expressions
0 references
tree representations
0 references
algebraic expressions
0 references
parallelizable algorithm
0 references
associative
0 references
commutative
0 references
simply generated families of trees
0 references
recognizable families of trees
0 references
enumeration problems
0 references
0.8546711
0 references
0.8446321
0 references
0.8436435
0 references
0.8350595
0 references
0.8350595
0 references
0.8318936
0 references
