Enumerating regular languages in radix order - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

Enumerating regular languages in radix order

Nadime Francis
Victor Marsault

Résumé

We consider the problem of enumerating a regular language $L$ in radix order, or more precisely, the equivalent problem of enumerating all words in $L$ of a given length in lexicographic order. Ackerman and Shallit gave in 2009 the principles of an efficient solution to this problem, but they did not use the enumeration complexity framework for their analysis. We adapt their work into an explicit algorithm that fits this framework.

Dates et versions

hal-04288155 , version 1 (15-11-2023)

Identifiants

Citer

Nadime Francis, Victor Marsault. Enumerating regular languages in radix order: Revisiting the Ackerman-Shallit algorithm. 2023. ⟨hal-04288155⟩
28 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More