Acta Informatica

, Volume 35, Issue 1, pp 17–89 | Cite as

Generating words lexicographically: An average-case analysis

  • Rainer Kemp


We show that many combinatorial algorithms which generate certain objects of a given size systematically, actually follow a simple pattern, when the objects are coded appropriately as words in a suitable ordered alphabet. This observation implies a complete average-case analysis of a type of algorithm generating these words lexicographically. This analysis can be carried out even in cases where no information about the algorithm itself is available. We demonstrate our results by discussing various concrete applications, such as the generation of words in a given regular language, the generation of permutations, the generation of subsets of a given set, the generation of semi-Dyck words, the generation of Motzkin words, the generation of \(t\)–ary ordered trees according to Ruskey and Zaks, the generation of ordered trees with bounded height and the generation of various classes of 0–balanced ordered trees.


Regular Language Simple Pattern Combinatorial Algorithm Concrete Application Generate Word 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Rainer Kemp
    • 1
  1. 1. Johann Wolfgang von Goethe-Universität, Robert-Mayer-Strasse 11–15, Fachbereich Informatik, D-60054 Frankfurt am Main, Germany DE

Personalised recommendations