Publication:3396587
From MaRDI portal
zbMath1169.68466MaRDI QIDQ3396587
Publication date: 19 September 2009
68Q45: Formal languages and automata
Related Items
Compacted binary trees admit a stretched exponential, Enumerating regular expressions and their languages, Succinct representation for (non)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, EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA