Three New Algorithms for Regular Language Enumeration
From MaRDI portal
Recommendations
- Efficient Enumeration of Regular Languages
- Efficient enumeration of words in regular languages
- scientific article; zbMATH DE number 1261119
- Enumerating the strings of regular languages
- LATIN 2004: Theoretical Informatics
- scientific article; zbMATH DE number 798342
- scientific article; zbMATH DE number 2182425
- Algorithms for computing the \(\lambda\)-regularities in strings
- scientific article; zbMATH DE number 1134630
- The dissecting power of regular languages
Cites work
Cited in
(9)- Efficient Enumeration of Regular Languages
- scientific article; zbMATH DE number 1261119 (Why is no real title available?)
- scientific article; zbMATH DE number 1528666 (Why is no real title available?)
- The State Complexity of Lexicographically Smallest Words and Computing Successors
- ENUMERATING NONDETERMINISTIC AUTOMATA FOR A GIVEN LANGUAGE WITHOUT CONSTRUCTING THE CANONICAL AUTOMATON
- Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages
- Enumerating \(m\)-length walks in directed graphs with constant delay
- A formal language perspective on factorized representations
- Efficient enumeration of words in regular languages
This page was built for publication: Three New Algorithms for Regular Language Enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5323062)