Efficient enumeration of words in regular languages
From MaRDI portal
Publication:840765
DOI10.1016/j.tcs.2009.03.018zbMath1191.68370OpenAlexW1996328142MaRDI QIDQ840765
Margareta Ackerman, Jeffrey O. Shallit
Publication date: 14 September 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.03.018
Related Items
Prefix-suffix square reduction, The State Complexity of Lexicographically Smallest Words and Computing Successors, Three New Algorithms for Regular Language Enumeration, Evaluation and Enumeration Problems for Regular Path Queries, Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages
Uses Software
Cites Work
