Three New Algorithms for Regular Language Enumeration

DOI10.1007/978-3-642-02882-3_19zbMath1248.68540OpenAlexW1504040240MaRDI QIDQ5323062

Margareta Ackerman, Erkki Maekinen

Publication date: 23 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_19

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Formal languages and automata (68Q45)

Related Items (2)

The State Complexity of Lexicographically Smallest Words and Computing Successors ⋮ Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages

Cites Work

• Efficient enumeration of words in regular languages
• Finite Automata, Palindromes, Powers, and Patterns
• Unnamed Item
• Unnamed Item

This page was built for publication: Three New Algorithms for Regular Language Enumeration