In this paper, we provide a novel enumeration algorithm for the set of all walks of a given length within a directed graph. Our algorithm has worst-case constant delay between outputting succinct representations of such walks, after a preprocessing step requiring linear time relative to the size of the graph. We apply these results to the problem of enumerating succinct representations of the strings of a given length from a prefix-closed regular language (languages accepted by a finite automaton which has final states only).

翻译：本文提出了一种新颖的枚举算法，用于有向图中给定长度的所有游走集合。在预处理步骤（所需时间与图的大小呈线性关系）之后，该算法在输出此类游走的简洁表示时，具有最坏情况下的恒定延迟。我们将这些结果应用于枚举前缀封闭正则语言（仅具有最终状态的有限自动机所接受的语言）中给定长度字符串的简洁表示问题。