Efficient enumeration of words in regular languages

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

zbMATH Keywords

enumerationregular languagelexicographical orderNFA

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

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

• Grail

Cites Work

• Matrix multiplication via arithmetic progressions
• Gaussian elimination is not optimal
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient enumeration of words in regular languages