Efficient Enumeration of Regular Languages

DOI10.1007/978-3-540-76336-9_22MaRDI QIDQ3503909zbMATH OpenOpenAlexFDO

Authors Margareta Ackerman, Jeffrey Shallit

Publication date 10 June 2008

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-76336-9_22

zbMATH Keywords

enumerationlexicographical ordernondeterministic finite automatonradix orderregular language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Efficient enumeration of words in regular languages
• Enumerating the strings of regular languages
• LATIN 2004: Theoretical Informatics
• scientific article; zbMATH DE number 1261119
• Three New Algorithms for Regular Language Enumeration
• Efficient enumeration of regular expressions for faster regular expression synthesis
• scientific article; zbMATH DE number 6136496
• Efficient separability of regular languages by subsequences and suffixes
• Combinatorial Complexity of Regular Languages
• scientific article; zbMATH DE number 5309909

Cites work

• Gaussian elimination is not optimal
• scientific article; zbMATH DE number 3748431 (Why is no real title available?)
• scientific article; zbMATH DE number 1261119 (Why is no real title available?)
• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• Matrix multiplication via arithmetic progressions

Cited in

(11)

• Detecting palindromes, patterns and borders in regular languages
• Counting subwords and regular languages
• Efficient algorithms for membership in Boolean hierarchies of regular languages
• Finite Automata, Palindromes, Powers, and Patterns
• scientific article; zbMATH DE number 1261119 (Why is no real title available?)
• scientific article; zbMATH DE number 1528666 (Why is no real title available?)
• scientific article; zbMATH DE number 2086415 (Why is no real title available?)
• scientific article; zbMATH DE number 6136496 (Why is no real title available?)
• Three New Algorithms for Regular Language Enumeration
• Enumerating the strings of regular languages
• Efficient enumeration of words in regular languages

Describes a project that uses

Uses Software

• Grail

This page was built for publication: Efficient Enumeration of Regular Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503909)