scientific article; zbMATH DE number 1528666

MaRDI QIDQ4515248zbMATH OpenFDO

Authors Pál Dömösi

Publication date 13 November 2000

zbMATH Keywords

lexicographical enumeration

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1261119
• Three New Algorithms for Regular Language Enumeration
• Efficient enumeration of words in regular languages
• Efficient Enumeration of Regular Languages
• The set of minimal words of a context-free language is context-free

Cited in

(10)

• The set of minimal words of a context-free language is context-free
• Some examples of lexicographic order algorithms and some open combinatorial problems
• scientific article; zbMATH DE number 1261119 (Why is no real title available?)
• scientific article; zbMATH DE number 2104766 (Why is no real title available?)
• Enumerating grammar-based extractions
• Algorithms for producing and ordering lexical and nonlexical sequences out of one element
• Grammars for document spanners
• A formal language perspective on factorized representations
• Efficient enumeration of words in regular languages
• Linear algorithm for lexicographic enumeration of CFG parse trees

This page was built for publication:

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