scientific article; zbMATH DE number 5605090

MaRDI QIDQ3396587zbMATH OpenFDO

Authors Michael Domaratzki

Publication date 19 September 2009

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(7)

• On the average state and transition complexity of finite languages
• Compacted binary trees admit a stretched exponential
• Succinct representations for (non)deterministic finite automata
• Succinct representation for (non)deterministic finite automata
• Enumeration and generation with a string automata representation
• Enumerating regular expressions and their languages
• EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA

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 Q3396587)