Exhaustive generation of combinatorial objects by ECO

DOI10.1007/s00236-004-0139-xzbMath1090.68555OpenAlexW2080439923MaRDI QIDQ1889882

Silvia Bacchelli, Elena Barcucci, Elisabetta Grazzini, Elisa Pergola

Publication date: 13 December 2004

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-004-0139-x

zbMATH Keywords

succession rulesexhaustive generation algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Combinatorics on words (68R15)

Related Items

From object grammars to ECO systems, Inside the binary reflected gray code: flip-swap languages in 2-gray code order, Avoiding cross-bifix-free binary words, Generalized algorithm for restricted weak composition generation, Flip-swap languages in binary reflected Gray code order, Binary bubble languages and cool-lex order, Combinatorial Gray codes for classes of pattern avoiding permutations, Production matrices and riordan arrays, Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions, Generating restricted classes of involutions, Bell and Stirling permutations, On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia, Production matrices, Exhaustive generation for permutations avoiding (colored) regular sets of patterns, A general exhaustive generation algorithm for Gray structures, Enumeration of L-convex polyominoes by rows and columns, Efficient iteration in admissible combinatorial classes, Combinatorial generation via permutation languages. I. Fundamentals