Recursive algorithm to generate stack permutations: an exercise in software adaptation
Conference
·
OSTI ID:6294375
A brute force method of generating stack permutations is to generate all permutations and then reject those that do not satisfy the stack permutation property. We develop a better (recursive) algorithm for generating stack permutations by adaptation of a formally derived recursive algorithm for generating permutations. We first analyze properties of stack permutations to arrive at a test condition which can be used in conjunction with the permutation algorithm. This test is then integrated into that algorithm to achieve the desired result.
- Research Organization:
- Argonne National Lab., IL (USA)
- DOE Contract Number:
- W-31-109-ENG-38
- OSTI ID:
- 6294375
- Report Number(s):
- CONF-830716-1; ON: DE83010743
- Resource Relation:
- Conference: 10. international colloquium on automata languages and programming, Barcelona, Spain, 18 Jul 1983
- Country of Publication:
- United States
- Language:
- English
Similar Records
Correspondence between stack permutations and internal node labels of tree codes representing binary trees
Recursive adaptive-filter design using an adaptive genetic algorithm
Algorithms and architectures for adaptive least squares signal processing, with applications in magnetoencephalography
Conference
·
Fri Jan 01 00:00:00 EST 1982
·
OSTI ID:6294375
Recursive adaptive-filter design using an adaptive genetic algorithm
Conference
·
Fri Jan 01 00:00:00 EST 1982
·
OSTI ID:6294375
Algorithms and architectures for adaptive least squares signal processing, with applications in magnetoencephalography
Technical Report
·
Sat Oct 01 00:00:00 EDT 1988
·
OSTI ID:6294375