Generating words lexicographically: An average-case analysis

DOI10.1007/S002360050114MaRDI QIDQ1386447zbMATH OpenOpenAlexFDO

Authors Rainer Kemp

Publication date 24 May 1998

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002360050114

zbMATH Keywords

generation of Motzkin wordsgeneration of semi-Dyck wordsgeneration of words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• scientific article; zbMATH DE number 1206598
• On the lexicographical generation of compressed codes
• scientific article; zbMATH DE number 2104766
• Some examples of lexicographic order algorithms and some open combinatorial problems
• scientific article; zbMATH DE number 3864523

Cited in

(9)

• On the lexicographical generation of compressed codes
• scientific article; zbMATH DE number 2104766 (Why is no real title available?)
• Efficient iteration in admissible combinatorial classes
• The relevant prefixes of coloured Motzkin walks: an average case analysis
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
• The scientific works of Rainer Kemp (1949--2004)
• Algorithms for producing and ordering lexical and nonlexical sequences out of one element
• Iterating Through Labelled Combinatorial Structures
• Some examples of lexicographic order algorithms and some open combinatorial problems

This page was built for publication: Generating words lexicographically: An average-case analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386447)