scientific article

From MaRDI portal

Revision as of 17:03, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3396587

Jump to:navigation, search

zbMath1169.68466MaRDI QIDQ3396587

Michael Domaratzki

Publication date: 19 September 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

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

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3396587&oldid=16676313"