scientific article; zbMATH DE number 5605090
From MaRDI portal
Publication:3396587
zbMATH Open1169.68466MaRDI QIDQ3396587FDOQ3396587
Authors: Michael Domaratzki 
Publication date: 19 September 2009
Title of this publication is not available (Why is that?)
Cited In (7)
- EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA
- Compacted binary trees admit a stretched exponential
- Enumeration and generation with a string automata representation
- On the average state and transition complexity of finite languages
- Succinct representations for (non)deterministic finite automata
- Enumerating regular expressions and their languages
- Succinct representation for (non)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)
