Efficient Enumeration of Regular Languages

DOI10.1007/978-3-540-76336-9_22zbMath1139.68351OpenAlexW1605990238MaRDI QIDQ3503909

Margareta Ackerman, Jeffrey O. 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

enumerationregular languagenondeterministic finite automatonlexicographical orderradix order

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Finite Automata, Palindromes, Powers, and Patterns ⋮ Detecting palindromes, patterns and borders 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 Regular Languages