Syntactic view of sigma-tau generation of permutations
From MaRDI portal
Recommendations
Cites work
- A new algorithm for generation of permutations
- An explicit universal cycle for the (n-1)-permutations of an n-set
- Automata, Languages and Programming
- Combinatorial generation via permutation languages
- Greedy flipping of pancakes and burnt pancakes
- scientific article; zbMATH DE number 140457 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3573250 (Why is no real title available?)
- scientific article; zbMATH DE number 1265079 (Why is no real title available?)
- scientific article; zbMATH DE number 6850346 (Why is no real title available?)
- scientific article; zbMATH DE number 6297698 (Why is no real title available?)
- scientific article; zbMATH DE number 3407692 (Why is no real title available?)
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Ranking and unranking permutations in linear time
- Solving the sigma-tau problem
- Syntactic view of sigma-tau generation of permutations
Cited in
(4)
This page was built for publication: Syntactic view of sigma-tau generation of permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918363)