Exhaustive generation of combinatorial objects by ECO

DOI10.1007/s00236-004-0139-xzbMath1090.68555MaRDI 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 rules; exhaustive generation algorithm

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

68R05: Combinatorics in computer science

68R15: Combinatorics on words

Related Items

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